Kruskal's MST algorithm on a 6-node weighted graph.

Weighted graph · Kruskal greedy + DSU cycle check MST edge current cycle (skip)
Step 0 / 0

Press Play. Sort all edges by weight. Walk the list; accept any edge whose endpoints are in different DSU sets.

Speed
MST edges
0
total weight
0
components
6
progress
0%
timeline0 / 0
←→space walk steps