| 求赋权连通图最优树的用边率 |
| |
| 引用本文： | 宋昭润.求赋权连通图最优树的用边率[J].湘潭大学自然科学学报,1995,17(4):101-105. |
| |
| 作者姓名： | 宋昭润 |
| |
| 作者单位： | 湘潭大学自动化与电子工程系 |
| |
| 摘 要： | 对赋权连通图求最优树已有三种方法，用边率可以衡量方法的计算量．本文分别导出三种方法的用边率，理论分析与实例计算所得结论是选边法为最简算法．
|
| 关 键 词： | 避圈，破圈，选边，同权边，用边率 |
USED EDGS NEMBER STUDY WHEN SOLVE THE WEIGHTED GRAPH AN OPTIMAL TREE |
| |
| Song Zhaorun.USED EDGS NEMBER STUDY WHEN SOLVE THE WEIGHTED GRAPH AN OPTIMAL TREE[J].Natural Science Journal of Xiangtan University,1995,17(4):101-105. |
| |
| Authors: | Song Zhaorun |
| |
| Abstract: | This three kind method had give that the determin an optimal tree of the same weighted graph. The edgs used members may measure to calculate nembers of the method.This article give the edgs used nembers of the every kind method. The conclusion from theoretic analyse and practical example calculate show that the easiest method of the three method is election degs method. |
| |
| Keywords: | avoidane circle breakage circle election edgs same weighted edgs used edgs nembers |
| 本文献已被 CNKI 维普 等数据库收录！ |
