Module
Greedy Graph Algorithms: Shortest Paths and MSTs
Sign in to add this module to your path and practice.
About
Dijkstra (non-negative weights), Prim and Kruskal MSTs, cut property, and Union-Find for Kruskal. Builds directly on graph traversals and greedy proofs.
Goal
Correctly run and analyze Dijkstra and at least one MST algorithm; prove the cut property or optimality of Kruskal/Prim; and implement the algorithms with efficient supporting structures.
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Greedy Graph Algorithms: Shortest Paths and MSTs. Ask about the concepts, goal, or where you're stuck.