Kruskal's Algorithm
Minimum spanning forests by sorted edges and disjoint-set union.
Minimum spanning forests by sorted edges and disjoint-set union.
The cut property connecting Prim's and Kruskal's safe edge choices.
Growing a minimum spanning tree across the lightest eligible cut edge.