Minimum Spanning Tree (Kruskal's)
Find the subset of edges that connects all vertices with the minimum total edge weight using the Union-Find logic.
Click to add nodes, drag from node to node to add weighted edges.
0
Total MST Weight
Ready. Click Run to start.
💡 How to use
- Standardize Buttons will inject controls here automatically.
- This visualizer demonstrates Kruskal's Algorithm.
- It sorts edges by weight and adds them if they don't form a cycle.