1. Array
Start your learning journey by understanding the most fundamental data structure.
2. Singly Linked List
Learn in-depth the most fundamental data structure in a programmer's life
6. Queue
Learn about the data structure that powers CPU and disk scheduling algorithms
7. Binary Tree
Learn all about the most critical data structure in computer science
What you will learn
What are graphs and what makes them special
Structure, representation and implementation of different graphs
Most common graph algorithms and their implementation
Understand essential patterns behind common interview problems
Intuition through visual explanation of algorithms
Hands on practical experience in a setup free coding environment
Requirements
This is a complete course and assumes that you know nothing about graphs but are familiar with some basic foundational topics and data structures in any programming language.
- Basic knowledge of programming in any language
- Basic knowledge of functions, classes and memory management
- You have completed courses on linked list, stacks and queues
- You have completed courses on recursion, backtracking and binary trees
Overview
Data structures are used extensively in software development and a graph is the most fundamental of all data structures. Irrespective of the language, framework, or system that you use, you will always be using a graph in some form or the other.
Representation of a graph
Fundamentals
This course teaches you the fundamentals of a graph and how it works. It provides you with code implementations and detailed explanations of a graph and its operations in the most intuitive way. We go step by step to explore its various functions which will give you a deep insight into this awesome data structure. This will help you gain a thorough understanding of the most important data structure of all.
Problems Solving
This course is an interactive course with high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by providing detailed explanations of the most common interview problems on a graph. This will help you gain confidence and understand how to convert your learning into action. By the end of the course, you will be pretty confident to solve any graph problem thrown at you.
Who this course is for
This course is an all-rounder course and targets a variety of audiences ranging from complete beginners to experienced programmers who want to take their knowledge to the next level. You will greatly benefit from this course if you identify yourself as one of the following
- Non developers who want to start their journey to learn data structures
- Developers who want to get deepest knowledge of graphs
- Anyone interested in improving their problem solving skills
- Anyone preparing for programming interviews
Course Contents
1. Introduction to graphs
2. Adjacency matrix representation
3. Adjacency list representation
4. Traversing a graph
6. Topological sort
8. Finding shortest path
9. Maximum bipartite matching
10. Max-flow Min-cut theoram
11. Pattern: Depth first search
12. Pattern: Breadth first search
13. Pattern: Connected components
15. Certificate
Forever offer!: 70% OFF
Annual
$4
.97
/MO
Billed annualy at$199$59.7
Graph
Learn about the most dynamic data structure in computer science