最小耗费生成树剔除算法及其正确性证明

A practical algorithm for constructing a minimum spanning tree

文章提出了一种新的最小耗费生成树的算法 ,并对其正确性进行了证明。该算法通过从原图中逐步剔除边来形成生成树 ,特别适用于当原图中边数较少 (相对于顶点数 ) 。

This paper developed a new algorithm for constructing a minimum spanning tree.The algorithm does this by cutting lines from the original graph step by step, for smallscale graphs,this algorithm has apparent advantages over traditional algorithms.