摘要
最小生成树问题是运筹学网络优化中一个常见的基本问题.提出了一种新的求最小生成树的矩阵算法,此算法可以不必在原图上进行操作而得到最小生成树,过程简单易懂.
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.
出处
《郑州大学学报(理学版)》
CAS
北大核心
2013年第4期23-25,36,共4页
Journal of Zhengzhou University:Natural Science Edition
基金
河北省自然科学基金资助项目
编号A201320119
关键词
最小生成树
网络优化
矩阵算法
minimum spanning tree
network optimization
matrix algorithm