【摘要】 图的最小生成树已经有了好算法,但当图增加或删去几条边或者少数几条边的权调整时,最小生成树的边、权可能发生变化,用原算法寻找最小生成树时,显得比较麻烦.利用破回路算法给出一个简单的调整方法.并给出了相应的示例.更多还原

【Abstract】 There are good algorithms for minimum spanning tree of graph. However when adjustment of a few edges and the weights of a few edges on graph,the edges and weights of minimum spanning tree can be changed. It is troublesome to find the minimum spanning tree in old algorithm. This article gives a simple adjustable project and instances on adjustable project.更多还原