Back to Paths
🕸️
Graphs: BFS, DFS & Shortest Paths
Model problems as graphs and pick the right traversal: BFS for layers, DFS for components, topological sort for dependencies and Dijkstra for weighted paths.
3
Modules
14h
Duration
16
Students
500
Coins Reward
Course Modules
1
Components and grids
Flood fill and union-find.
2
Dependencies
Topological ordering and cycle detection.
3
Weighted shortest paths
Dijkstra's algorithm with a heap.