| 利用找环去边法求最小生成树的算法探析 |
| |
| 引用本文： | 姜洪溪,陈丹.利用找环去边法求最小生成树的算法探析[J].襄樊学院学报,2002,23(5):66-68. |
| |
| 作者姓名： | 姜洪溪 陈丹 |
| |
| 作者单位： | 襄樊学院,电气信息工程系,湖北,襄樊,441053 |
| |
| 摘 要： | 章在对连通网的特征进行分析的基础上，提出了一种利用找环去边法求最小生成树的算法，并对此算法作了定性的分析。
|
| 关 键 词： | 环秩 连通网 生成树 最小生成树 |
| 文章编号： | 1009-2854(2002)05-0066-03 |
| 修稿时间： | 2002年1月18日 |
On Algorithm of Producing Minimum Cost Spanning Tree by Method of Seeking Cycles to Romove Its Edge |
| |
| JIANG Hong-xi,CHAN Dan.On Algorithm of Producing Minimum Cost Spanning Tree by Method of Seeking Cycles to Romove Its Edge[J].Journal of Xiangfan University,2002,23(5):66-68. |
| |
| Authors: | JIANG Hong-xi CHAN Dan |
| |
| Abstract: | 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. |
| |
| Keywords: | Cycle rank Connected network Spanning tree Minimum Cost Spanning Tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
