| 求最小生成树的矩阵算法 |
| |
| 引用本文： | 毛华,史田敏,高瑞. 求最小生成树的矩阵算法[J]. 郑州大学学报(自然科学版), 2013, 0(4): 23-25,36 |
| |
| 作者姓名： | 毛华 史田敏 高瑞 |
| |
| 作者单位： | [1]河北大学数学与计算机学院,河北保定071002 [2]沧州师范学院数学系,河北沧州061001 |
| |
| 基金项目： | 河北省自然科学基金资助项目,编号A201320119. |
| |
| 摘 要： | 最小生成树问题是运筹学网络优化中一个常见的基本问题．提出了一种新的求最小生成树的矩阵算法，此算法可以不必在原图上进行操作而得到最小生成树，过程简单易懂．
|
| 关 键 词： | 最小生成树 网络优化 矩阵算法 |
Study on Minimum Spanning Tree Algorithm of Matrix |
| |
| MAO Hua,SHI Tian-minl GAO Rui. Study on Minimum Spanning Tree Algorithm of Matrix[J]. Journal of Zhengzhou University (Natural Science), 2013, 0(4): 23-25,36 |
| |
| Authors: | MAO Hua SHI Tian-minl GAO Rui |
| |
| Affiliation: | 1. College of Mathematics and Computer Science, Hebei University, Baoding 071002, China; 2. Department of Mathematics, Cangzhou Normal University, Cangzhou 061001, China) |
| |
| Abstract: | Minimum spanning tree problem was common in operation research for network optimization. A new minimum spanning tree algorithm of matrix was put forward. This algorithm was simple to under- stand and could be easily done with computer. |
| |
| Keywords: | minimum spanning tree network optimization matrix algorithm |
| 本文献已被 维普 等数据库收录！ |
