| 边权相同的最小生成树改进算法 |
| |
| 作者单位： | ;1.信阳师范学院计算机与信息技术学院 |
| |
| 摘 要： | 针对当赋权连通图中存在权值相同的多条边时,传统的Kruskal算法不能计算出全部的最小生成树,提出了求解最小生成树的改进算法.实验结果表明,改进算法可以得到一个赋权连通图的所有最小生成树,进而为决策者提供更全面的最优决策方案.
|
| 关 键 词： | 最小生成树 Kruskal算法 赋权图 |
An Improved Minimum Spanning Tree Algorithm Based on the Same Weight of Edges |
| |
| Affiliation: | ,School of Computer and Information Technology,Xinyang Normal University |
| |
| Abstract: | For the case that the traditional Kruskal algorithm is unable to find all the minimum spanning trees(MST)when some edges have the same weights in the weighted graph,the improved algorithm about MST was proposed.Experimental results showed that the improved algorithm can give all the minimum spanning trees,which can provide a more comprehensive optimal decision-making scheme than that of the traditional algorithm. |
| |
| Keywords: | minimum spanning tree(MST) Kruskal algorithm weighted graph |
| 本文献已被 CNKI 等数据库收录！ |
|
