โ† Back to Index

๐ŸŒ‰ Kruskal MST

Minimum Spanning Tree ยท Edge Sort + Union-Find
-
Current Edge
0
Current Weight
0
MST Weight
0
Edges Picked
Ready
Status
Current candidate edge
Accepted MST edge
Rejected cycle edge
Sorted edge queue focus

Sorted Edge Queue

How It Works

Kruskal sorts all edges by weight, then scans from lightest to heaviest. An edge is accepted only if it connects two different components.