摘要
针对关系矩阵表示的复杂网络图 ,分析构成其最小支撑树的元素特点 ,提出两种求最小支撑树的方法 :直接生成法和表上作业法 .两种方法不需要作出复杂的网络图 ,而直接从关系矩阵中生成最小支撑树 ,从而能有效克服传统方法需绘网络图之不便 .经实例研究 ,两种方法在求解复杂问题的最小支撑树时有独到之处 .
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.
出处
《郑州工业大学学报》
CAS
2001年第3期104-107,共4页
Journal of Zhengzhou University of Technology
基金
河南省自然科学基金资助项目 (0 0 4 0 4 1 0 0 0 )
