摘要
文章在对连通网的特征进行分析的基础上,提出了一种利用找环去边法求最小生成树的算法,并对此算法作了定性的分析.
In this paper, on the bases of analyzing the characteristics about Connected Network, an algorithm that produces the Minimum Cost Spanning Tree by using the method of seeking the cycles in a Connected Network and removing an edge in each cycle is put forward. By analyzing its basic properties it is shown the algorithm in practice is efficlent. After this, we analyze the basic properties of the algorithm.
出处
《襄樊学院学报》
2002年第5期66-68,共3页
Journal of Xiangfan University
关键词
环秩
连通网
生成树
最小生成树
Cycle rank
Connected network
Spanning tree
Minimum Cost Spanning Tree
