Kruskal's MST Algorithm
Minimum Spanning Tree Visualization
Time:
O(E log V)
Space:
O(V + E)
Graph Visualization
Sorted Edge List
Disjoint Set (Union-Find)
Controls
Step:
0
Play
Pause
Step
Reset
Step Explanation
Click
Play
or
Step
to begin the visualization.
Pseudocode
Legend
Normal Edge
Current Edge
MST Edge
Highlighted Node