#kruskal

Kruskal:Grow an MST by Cheapest Edge That Does Not Cycle

Sort every undirected edge cheapest-first, skip endpoints already in the same Union-Find component, accept the rest until n-1 edges — an MST that is not a shortest path from a source.

Read More →