Kruskal’s Greedy Algorithm

Sort the edges by increasing cost;

Initialize A to be empty;

For each edge e chosen in increasing order do

if adding e does not form a cycle then

add e to A

Invariant: A is always contained in some

minimum spanning tree

Previous slide

Next slide

Back to first slide

View graphic version