Kruskal's Algorithm Visualization
Find Minimum Spanning Tree by sorting edges and using Union-Find data structure
Add Vertex
Add Weighted Edge
Minimum Spanning Tree
Add vertices and weighted edges to create a graph, then run Kruskal's algorithm!
MST Edges
No edges in MST yet
Algorithm Status
Vertices: 0
Total Edges: 0
MST Edges: 0
Total Weight: 0
Progress: 0/0
Legend
Original Edge
Considering Edge
MST Edge
Rejected Edge
Kruskal's Algorithm Properties
Time Complexity
O(E log E)
Space Complexity
O(V)
Data Structure
Union-Find
Use Cases
Network design, Clustering