🌲 Kruskal's MST Algorithm
Build Minimum Spanning Tree by adding edges in weight order
Kruskal's Algorithm:
Sort all edges by weight. Add edges one by one, skipping any that would create a cycle. Uses Union-Find to detect cycles efficiently.
Click "Next Step" to start building the MST.
0
Edges Added
0
Total Weight
Unprocessed
Considering
Added to MST
Rejected (cycle)
Edges (sorted by weight):
🔄 Reset
▶️ Next Step
⏩ Auto Play