PHASE 09
๐ธ๏ธ Graphs
Maps, friendships and course prerequisites are graphs. Represent them, explore them with BFS and DFS, count islands, find shortest paths and order tasks with dependencies.
โฑ๏ธ ~2 hours of lessons
๐ 3 lessons
โ๏ธ 6 exercises Hard
โถ Start this phase
๐ฏ In this phase you willโฆ
- Represent graphs with adjacency lists
- Traverse with BFS and DFS
- Find shortest paths in unweighted and weighted graphs
- Order tasks with topological sort
๐บ Lessons in this playlist
๐ Phase test
Concept questions, pseudocode writing, tracing and debugging โ check youโre ready for the next phase.
๐ก Concept check
What does a visited set prevent in graph traversal?
