In any Data Structures and Algorithms interview, Graphs are one of the most important topics. This course is designed to help a candidate master Graphs.

This course provides a detailed insight into graphs. It is designed to help candidates learn graphs from a very basic to cracking any graph problem. In this course, each topic is explained in detail, ensuring the coverage of all important fundamentals, followed by many problems covering all varieties of concepts and difficulty levels.

Deep dive into Graph Algorithms: Beginner to Interview Ready

You are given a graph consisting of n nodes along with an array 'edges' where edges[i] = [x, y] indicates that there exists a bidirectional edge between the nodes x and y in the graph.

Return the number of connected components in the graph.

Link: https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/

Flow

Graph Terminologies and Representations

Graph Traversals : Breadth - First Search

Graph Traversals : Depth - First Search

Topological Sorting

Cycle Detection : Directed and Undirected Graphs

Disjoint Set Structures : Union Find

Minimum Spanning Tree

Shortest Path Finding Algorithms

Articulation Points and Bridges

Biconnected Components

Strongly Connected Components

Eulerian Circuit

Bipartite Graphs

Important Graph Algorithms

Miscellaneous Problems: Intermediate and Advanced Levels

Problem 1: Find the number of connected components