|
|||||
|
|
| 计算最小支撑出树的一种简便算法 | |
| 引用本文： | 翟晓燕. 计算最小支撑出树的一种简便算法[J]. 应用数学与计算数学学报, 1999, 13(2): 87-93 |
| 作者姓名： | 翟晓燕 |
| 作者单位： | 广州大学模糊系统与知识工程研究所!广州，510091 |
| 摘 要： | 本文通过对网络中有向支撑出树性质的研究，提出了在有向网络图中寻找以某一定点为根的最小有向支撑出树一种较简便的计算方法，并给出了应用该算法进行实际操作的一个算例． |
| 关 键 词： | 网络 以一点为根的支撑出树 最小支撑出树 |
An Simple Algorithm for Finding the Minimum Spanning Outgoing Tree in a Network |
|
| XIAOUN ZHAI. An Simple Algorithm for Finding the Minimum Spanning Outgoing Tree in a Network[J]. Communication on Applied Mathematics and Computation, 1999, 13(2): 87-93 | |
| Authors: | XIAOUN ZHAI |
| Abstract: | In this paper, we study the propeties of the spanning outgoing tree in a network,and proposea simple algorithm for finding the minimum spanning outgoing tree in a network,we also presentan example for applying this algorithm. |
| Keywords: | network spanning outgoing tree with a root minimum spanning outgoing tree |
| 本文献已被 CNKI 维普 等数据库收录！ | |