求最大生成树的改进的矩阵算法

Research on improved matrix algorithms of maximum spanning tree

生成树问题是图论、运筹学、资源优化、物流等中常见的基本问题,本文在生成树常见算法避圈法、破圈法、普里姆算法的基础上研究了最大生成树改进的权矩阵算法,并研究了算法的实际应用.

Spanning tree problem is a common basic problem in graph theory,operational research,resource optimization,logistics,etc.On the basis of avoiding circle,breaking circle and prim algorithm,this paper studies the improved weight matrix algorithm of the maximum spanning tree and its practical application.