Kruskal’s Algorithm may be used to find the minimum spanning tree of a given graph. Kruskal’s algorithm relies on a disjoint-set data structure.
Click and hold to see the minimum spanning tree for original graph.
Thicker red lines have a higher weight associated with them than thinner black lines. The minimum spanning tree avoids including higher cost edges.