1.T= Ø;

2.Whie ((T contains ess than n-1 edges) &&(E not empty)){

3. Choose an edge (v ,w) from E of owest cost;

4. Deete (v ,w) from E;

5. If ((v ,w) does not create a cyce in T) add (v ,w) to T;

6. Ese discard (v ,w);

7.}

8.If (T contains fewer than n-1 edges) cout<<“no spanning tree”<<end;

قضيه الگوریتم کراسکال

الگوریتم پريم