Embark on a comprehensive journey into the world of Graph Algorithms, an essential topic in computer science and competitive programming. This learning path covers fundamental concepts from graph representation and traversal (BFS, DFS) to advanced algorithms for shortest paths (Dijkstra, Bellman-Ford, Floyd-Warshall), minimum spanning trees (Prim's, Kruskal's), topological sort, and detecting complex graph structures like cycles, bipartite graphs, strongly connected components, bridges, and articulation points. You will gain both theoretical understanding and practical implementation skills through video lessons and challenging quiz questions, preparing you for technical interviews and complex problem-solving.
G-4. What are Connected Components ?
7:07
G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs
19:39
G-6. Depth-First Search (DFS) | C++ and Java | Traversal Technique in Graphs
20:16
G-10. Rotten Oranges | C++ | Java
22:30
G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java
18:02
Quiz: Graph Traversal: BFS & DFS
10 min
G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java
20:19
G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java
19:10
G-17. Bipartite Graph | BFS | C++ | Java
18:29
G-18. Bipartite Graph | DFS | C++ | Java
14:54
G-19. Detect cycle in a directed graph using DFS | Java | C++
17:22
Quiz: Cycle Detection & Special Graph Properties
10 min
G-21. Topological Sort Algorithm | DFS
13:30
G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS
13:50
G-23. Detect a Cycle in Directed Graph | Topological Sort | Kahn's Algorithm | BFS
6:17
G-24. Course Schedule I and II | Pre-requisite Tasks | Topological Sort
11:32
G-26. Alien Dictionary - Topological Sort
20:54
G-27. Shortest Path in Directed Acyclic Graph - Topological Sort
26:36
Quiz: Topological Sort & Its Applications
10 min
G-28. Shortest Path in Undirected Graph with Unit Weights
16:32
G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1
22:42
G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3
14:30
G-41. Bellman Ford Algorithm
27:43
G-42. Floyd Warshall Algorithm
30:13
Quiz: Shortest Path Algorithms
10 min
G-44. Minimum Spanning Tree - Theory
7:59
G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java
19:10
G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression
42:15
G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java
13:11
Quiz: Minimum Spanning Trees (MST) & Disjoint Set Union
10 min