最小生成树边与边的权的调整  

Adjustment on minimum-weight spanning tree's edge and weight of edge

作　　者：石少俭[1] 贺红[1] 赵然[1] 

机构地区：[1]山东理工大学计算机科学与技术学院,山东淄博255049

出　　处：《山东理工大学学报（自然科学版）》2004年第5期81-84,共4页Journal of Shandong University of Technology:Natural Science Edition

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

关 键 词：最小生成树 算法 示例 边 权 调整 图论 连通赋权无向图 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] O157.5[自动化与计算机技术—计算机科学与技术]