Tag: greedy-algorithms

Prim and Kruskal independently showed how local greedy edge choices can provably construct a minimum spanning tree, one growing a connected tree and the other merging a forest.