Kruskal's Algorithm

Build the MST by sorting edges and merging components

Click "Next Step" to begin Kruskal's algorithm
0
Edges in MST
0
Total Weight
6
Components

Graph

Sorted Edges

Union-Find Components

Pseudocode

Unprocessed
Considering
In MST
Rejected (cycle)