首页 | 本学科首页   官方微博 | 高级检索  
     

最小生成树边与边的权的调整
引用本文:石少俭,贺红,赵然. 最小生成树边与边的权的调整[J]. 山东理工大学学报:自然科学版, 2004, 18(5): 81-84
作者姓名:石少俭  贺红  赵然
作者单位:山东理工大学计算机科学与技术学院,山东淄博255049
摘    要:图的最小生成树已经有了好算法,但当图增加或删去几条边或少数几条边的边调整时,最小生成树的边、权可能发生变化,用原算法寻找最小生成树时,显得比较麻烦.利用破回路算法给出一个简单的 方法.并给出了相应的示例.

关 键 词:最小生成树 算法 示例 边 权 调整 图论 连通赋权无向图
文章编号:1672-6197(2004)05-0081-04
修稿时间:2004-04-10

Adjustment on minimum-weight spanning tree''''s edge and weight of edge
SHI Shao-jian,HE Hong,ZHAO Ran. Adjustment on minimum-weight spanning tree''''s edge and weight of edge[J]. Journal of Shandong University of Technology:Science and Technology, 2004, 18(5): 81-84
Authors:SHI Shao-jian  HE Hong  ZHAO Ran
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.
Keywords:connected weight unordered graph  minimum spanning tree  algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号