| 应用破圈法求图的最优树的一种新算法 |
| |
| 引用本文： | 魏丽侠.应用破圈法求图的最优树的一种新算法[J].辽宁石油化工大学学报,1992(3). |
| |
| 作者姓名： | 魏丽侠 |
| |
| 作者单位： | 抚顺石油学院基础部 |
| |
| 摘 要： | 本文依据破圈法的原理提出了求图的最优树的一种新算法,并给出了具体的实现步骤。
|
| 关 键 词： | 带权邻接矩阵 最优树 |
A New Algorithm on Seeking a Optimal Tree of Graph Applying the Way "Breaking a Cycle" |
| |
| Wei Lixia.A New Algorithm on Seeking a Optimal Tree of Graph Applying the Way "Breaking a Cycle"[J].Journal of Liaoning University of Petroleum & Chemical Technology,1992(3). |
| |
| Authors: | Wei Lixia |
| |
| Abstract: | In this paper, a new algorithm is presented about gating a optimal tree by means of "Breaking a cycle", and its specific realizing procedure is given. |
| |
| Keywords: | Weighted adjacency matrix Optimal tree |
| 本文献已被 CNKI 等数据库收录！ |
