|
|||||
|
|
| 求最小支撑树的方法探讨 | |
| 引用本文： | 周丽,黄哲浩,王博,贺北方. 求最小支撑树的方法探讨[J]. 郑州大学学报(工学版), 2001, 22(3): 104-107 |
| 作者姓名： | 周丽 黄哲浩 王博 贺北方 |
| 作者单位： | 1. 郑州大学环境与水利学院, 2. 温州浅滩围涂工程建设指挥部, |
| 基金项目： | 河南省自然科学基金资助项目(004041000) |
| 摘 要： | 针对关系矩阵表示的复杂网络图,分析构成其最小支撑树的元素特点,提出两种求最小支撑树的方法直接生成法和表上作业法.两种方法不需要作出复杂的网络图,而直接从关系矩阵中生成最小支撑树,从而能有效克服传统方法需绘网络图之不便.经实例研究,两种方法在求解复杂问题的最小支撑树时有独到之处. |
| 关 键 词： | 最小支撑树 关系矩阵 网络图 |
| 文章编号： | 1007-6492(2001)03-0104-04 |
| 修稿时间： | 2001-03-01 |
Preliminary Study on the Method of Getting Minimum Spanning Tree |
|
| ZHOU Li ,HUANG Zhe-hao ,WANG Bo ,HE Bei-fang. Preliminary Study on the Method of Getting Minimum Spanning Tree[J]. Journal of Zhengzhou University: Eng Sci, 2001, 22(3): 104-107 | |
| Authors: | ZHOU Li HUANG Zhe-hao WANG Bo HE Bei-fang |
| Affiliation: | ZHOU Li 1,HUANG Zhe-hao 2,WANG Bo 1,HE Bei-fang 1 |
| Abstract: | In this paper, aiming at the complicated web graph denoted by relation matrix ,based on the analysis of the features of the elements constituting the minimum spanning tree, two methods of getting the minimum spanning tree, method of directly getting and performing on the table, have been put forward. By means of the two methods, the minimum spanning tree can be got directly without drawing the original web graph, which can effectively decrease the inconvenience of the traditional methods. Both the methods proved to be particularly useful in getting the minimum spanning tree. |
| Keywords: | minimum spanning tree relation matrix web graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |