Graph AlgorithmsKruskal's MST

Kruskal's MST

Sorts all edges by weight and adds each one that doesn't create a cycle, using union-find to detect cycles.

Advancedminimum spanning treegreedyunion-findweighted
Loading visualization…