Kruskal’s Algorithm with DU / F

Sort the edges by increasing cost;

Initialize A to be empty;

for each edge {i,j} chosen in increasing order do

u := Find(i);

v := Find(j);

if not(u = v) then

add {i,j} to A;

Union(u,v);

Previous slide

Next slide

Back to first slide

View graphic version