Kruskal's Algorithm

Minimum spanning tree: sort edges by weight, add each if it joins two different components (DSU).

Intermediate

$O(E\log E)$ . Designs cheapest networks — cable layouts, PCB ground connections.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)