Kruskal's Algorithm (Minimum Spanning Tree) Interactive Visualizer
Kruskal's Algorithm builds a Minimum Spanning Tree of a weighted undirected graph by sorting edges by weight and greedily adding each edge that does not form a cycle using Union-Find.
Study Kruskal's Algorithm (Minimum Spanning Tree) Explanation · View Multi-Language Code · All Algorithms