Description: K ruskal algorithm each time you select n-1 edges, using criteria of greed: from the left side, select a loop with no minimum spend has been selected to join the side edges of the collection. The selected side note, if you can not generate the formation of a spanning tree loop
To Search:
File list (Check if you may need any files):
kruskal.c
Download