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.
10 min readUpdated 2026-09-03graphsmstprimkruskal
Connect every node as cheaply as possible, using two classic greedy strategies that arrive at the same answer from opposite directions.