5.4.1 Pseudocode For The Kruskal Algorithm.

E(1) is the set of the sides of the minimum genetic tree.
E(2) is the set of the remaining sides.

STEPS

E(1)=0,E(2)=E

While E(1) contains less then n-1 sides and E(2)=0 do

From the sides of E(2) choose one with minimum cost-->e(ij)
E(2)=E(2)-{e(ij) }
If V(i),V(j) do not belong in the same tree then
- unite the trees of V(i) and V(j) to one tree.
end (If)
end (While)

End Of Algorithm.

A more detailed version of this algorithm requires definition of the data structure to be used,and will not bother us to this point.

HTML PAGE DIRECTOR :Papaioannou Panagiotis