寻找最小生成树的补图算法

On algorithm of producing minimum cost spanning trees by method of seeking complementary graph

提出了一种关于最小生成树的生成法,该算法与传统的prim算法及kruskal算法比较,有更低的计算复杂性.

Presents an algorithm for finding minimum spanning trees.Compared with the traditional algorithm of Prim and Kruskal,the new algorithm has its own advantage.