Minimum spanning tree (Kruskal/Prim)

Kruskal O(E log V) sorted edges + union-find; Prim O(E log V) with binary heap. Matroid-greedy; Borůvka's parallel algorithm.