Minimum Spanning Tree (Kruskal's)
Finds the subset of edges connecting all vertices with minimum total weight. It sorts all edges by weight, then uses Union-Find to grow the tree without cycles.
0
Total Nodes
0
Total Edges
0
Total MST Weight
0
Accepted Edges
KRUSKAL'S MST GRAPH
Editor Guide: Click empty space to add a node. Click and drag between nodes to connect them with a weighted undirected edge.
Execution Log
Click Load Example Map or design a graph, then run Kruskal's.
Presets
Legend
Node added to MST
Active / Checking edge
Unvisited Node
Time Complexity
Kruskal's time complexity is O(E log E) or O(E log V) due to sorting the edges.