[1]周丽,黄哲浩,王博,等.求最小支撑树的方法探讨[J].郑州大学学报(工学版),2001,22(03):104-107.[doi:10.3969/j.issn.1671-6833.2001.03.032]
　ZHOU Li,HUANG Zhehao,Wang Bo,et al.Discussion on the method of finding the minimum support tree[J].Journal of Zhengzhou University (Engineering Science),2001,22(03):104-107.[doi:10.3969/j.issn.1671-6833.2001.03.032]

点击复制

求最小支撑树的方法探讨()

分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:

22卷

期数:

2001年03期

页码:

104-107

栏目:

出版日期:

1900-01-01

文章信息/Info

Title:

Discussion on the method of finding the minimum support tree

作者:

周丽; 黄哲浩; 王博; 等.

郑州大学环境与水利学院,, 温州浅滩围涂工程建设指挥部,

Author(s):

ZHOU Li; HUANG Zhehao; Wang Bo; etc

关键词:

最小支撑树;  关系矩阵;  网络图

Keywords:

minimum support tree;  relationship matrix;  Network diagram

DOI:

10.3969/j.issn.1671-6833.2001.03.032

文献标志码:

A

摘要:

针对关系矩阵表示的复杂网络图,分析构成其最小支撑树的元素特点,提出两种求最小支撑树的方法:直接生成法和表上作业法.两种方法不需要作出复杂的网络图,而直接从关系矩阵中生成最小支撑树,从而能有效克服传统方法需绘网络图之不便.经实例研究,两种方法在求解复杂问题的最小支撑树时有独到之处.

Abstract:

Aiming at the complex network diagram represented by the relationship matrix, the characteristics of the elements constituting the minimum support tree are analyzed, and two methods for finding the minimum support tree are proposed: direct generation method and table operation method. The two methods do not need to make complex network diagrams, but directly generate the minimum support tree from the relationship matrix, which can effectively overcome the inconvenience of traditional methods to draw network diagrams. Through case studies, the two methods have unique features in solving the minimum support tree for complex problems.

常用功能