| 通风网络中最小生成树的O（n^2）算法 |
| |
| 引用本文： | 王义章.通风网络中最小生成树的O（n^2）算法[J].贵州科学,1995,13(2):15-20. |
| |
| 作者姓名： | 王义章 |
| |
| 作者单位： | 贵州省科委计算中心 贵阳550002 |
| |
| 摘 要： | 本文提出一个Ｏ（ｎ＾２）的最小生成树算法，并结合在矿井通风网络中的应用进行阐述，通过理论分析和实例解算，证明了算法是正确的和有效的，Ｏ（ｎ＾２）最小生成树算法也是对矿井通风网络解算方法的补充。
|
| 关 键 词： | 矿井 通风网络 最小生成树 算法 |
THE ALGORITHM OF O(n~2) MINIMAL SPANNING TREE AND ITS APPLICATION IN VENTILATION NETWORKS |
| |
| Wang Yizhang.THE ALGORITHM OF O(n~2) MINIMAL SPANNING TREE AND ITS APPLICATION IN VENTILATION NETWORKS[J].Guizhou Science,1995,13(2):15-20. |
| |
| Authors: | Wang Yizhang |
| |
| Abstract: | This paper present the algorithm or O(n2) minimal spanning tree and describe its application in the Ventilation networks. It is proved by theoretical analysis and sample calculation that the algorithm is correct and efficient. This algorithm replenish the method of Ventilation networks computation. |
| |
| Keywords: | Algorithm of O(n2) Minimal spanning tree ventilation networks |
| 本文献已被 CNKI 维普 等数据库收录！ |
