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.


  • E(1)=0,E(2)=E
  • While E(1) contains less then n-1 sides and E(2)=0 do
  • 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