| 最小支撑树的一种删除大权边算法及应用 |
| |
| 引用本文： | 李廷锋,孙惠娟,崔少勇. 最小支撑树的一种删除大权边算法及应用[J]. 太原科技, 2007, 165(10): 79-80 |
| |
| 作者姓名： | 李廷锋 孙惠娟 崔少勇 |
| |
| 作者单位： | 河南大学数学与信息科学学院,河南,开封,475001 |
| |
| 摘 要： | 最小支撑树的一种删除大权边算法是在Kruskal算法、Prim算法和破圈法的基础上,提出的另一种算法。介绍了删除大权边算法的基本概念和性质,列举了删除大权边算法的计算实例,叙述了删除大权边算法的及其应用。
|
| 关 键 词： | 赋权图 最小支撑树 算法 |
| 文章编号： | 1006-4877（2007）10-0079-02 |
| 收稿时间： | 2007-08-21 |
| 修稿时间： | 2007-09-01 |
The Arithmetic and Application of That a Minimum Spanning Tree Deletes Large Branch''''s Edge |
| |
| Li Tingfeng,Sun Huijuan,Cui Shaoyong. The Arithmetic and Application of That a Minimum Spanning Tree Deletes Large Branch''''s Edge[J]. Taiyuan Science and Technology, 2007, 165(10): 79-80 |
| |
| Authors: | Li Tingfeng Sun Huijuan Cui Shaoyong |
| |
| Abstract: | The arithmetic of that a minimum spanning tree deletes edges with the largest weight is another algorithm,which is on the basis of Kruskal algorithm,Prim algorithm and the Deleting circults.Introduce the basic concept and character of deleting edges with the largest weight,give some examples of arithmetic deleting edges with the largest weight,and narrate the arithmetic and application of deletes edges with the largest weight. |
| |
| Keywords: | graph with weight minimum spanning tree arithmetic |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
