4 lessons
Graphs and Traversal
Represent networks of relationships, then explore them with depth-first and breadth-first search.
Dijkstra & Shortest Paths
BFS finds the fewest edges. When edges have weights, you need something smarter.
Union-Find & Topological Sort
Track connected groups in near-constant time, and order tasks so every prerequisite comes first.
Minimum Spanning Trees: Prim's and Kruskal's
Connect every node as cheaply as possible, using two classic greedy strategies that arrive at the same answer from opposite directions.