Description: kruskal algorithm (annotated): the edge of the right in accordance with the value of small to large order, ran select an edge, if and front edges are added together do not constitute part of the edge, otherwise discard changes, the next one edge, where the ring is expressed by the collection of, nodes [i] = j that when the vertex i node j,
To Search:
- [Kruskal] - kruskal it maybe useful to,you can see i
File list (Check if you may need any files):
Kruskal.cpp
Download