Minimum Spanning Tree (Kruskal/Prim)

Greedily build a cheapest set of edges that connects all vertices with no cycle, using exactly n-1 edges.