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

__STEPS __

- 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.

- unite the trees of
- end (If)
- end (While)

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