Module 10 · 6 lessons · about 310 minutes
Graphs
Adjacency lists and grids, depth-first and breadth-first search, shortest steps and multi-source spreads, dependency order, union-find, and Dijkstra's shortest paths.
- Lessons
- 0/6
- Exercises
- 0/0
- Code
- 0/0
- Checkpoint
- Not taken
- 1What a graph is40 min
- 2Depth-first search60 min
- 3Breadth-first search60 min
- 4Dependencies and topological sort55 min
- 5Union-find45 min
- 6Weighted shortest paths50 min