Kruskal’s MST algorithm
Assume G is connected.
Idea:
Sort edges in increasing order of cost
Initialize tree T to be empty
For each edge e in sorted order
If T U {e} does not contain a cycle, add e to T;
output T;
Previous slide
Next slide
Back to first slide
View graphic version