Stage 4 — Global Reasoning · Module 23
GraphsGraphs
Representations, BFS/DFS, topological sort, union-find, shortest paths, MST.
- Concept lessons
- 6
- Problems
- 7
- Practice
- Hub
- Status
- Live
Concept map
Lessons
1.Graph Representationconcept2.DFS & BFS on Graphsconcept3.Topological Sortconcept4.Shortest Paths (BFS, Dijkstra)concept5.Union-Find (Disjoint Set)concept6.Minimum Spanning Trees (Kruskal's & Prim's)concept
Practice
Nodes + edges — BFS for short, DFS for components, Union-Find for merges.