| 最小生成树的算法及其应用 |
| |
| 引用本文： | 袁卫东. 最小生成树的算法及其应用[J]. 科学技术与工程, 2009, 9(15) |
| |
| 作者姓名： | 袁卫东 |
| |
| 作者单位： | 宝鸡职业技术学院,宝鸡,721013 |
| |
| 摘 要： | Kruskal算法和Prim算法是求最小生成树的常用算法.设计了这两种算法的C语言程序,并通过实例表明了算法的应用.
|
| 关 键 词： | 最小生成树 图 Kruskal算法 Prim算法 |
Algorithms and Application of Minimum Spanning Tree |
| |
| YUAN Wei-dong. Algorithms and Application of Minimum Spanning Tree[J]. Science Technology and Engineering, 2009, 9(15) |
| |
| Authors: | YUAN Wei-dong |
| |
| Affiliation: | Baoji Professional College;Baoji 721013;P.R.China |
| |
| Abstract: | Kruskal algorithm and Prim algorithm are general methods for sloving the minimum spanning tree.The C programming language each of them is designed,and examples show the application of the two algorithm. |
| |
| Keywords: | minimum spanning tree graph Kruskal algorithm Prim algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
