| 最小生成树算法及其应用 |
| |
| 引用本文： | 王新奇.最小生成树算法及其应用[J].西安文理学院学报,2009,12(3). |
| |
| 作者姓名： | 王新奇 |
| |
| 作者单位： | 西安文理学院学报编辑部,陕西西安710065;西安理工大学水利水电学院,陕西西安710048 |
| |
| 基金项目： | 西安文理学院科研基金资助项目 |
| |
| 摘 要： | Kruskal算法和Prim算法是求最小生成树的常用算法,文中设计了这两种算法的C语言程序,并通过实例说明了算法的应用.
|
| 关 键 词： | 最小生成树 图 Kruskal算法 Prim算法 |
Algorithms and Application of Minimum Spanning Tree |
| |
| WANG Xin-qi.Algorithms and Application of Minimum Spanning Tree[J].Journal of Xi‘an University of Arts & Science:Natural Science Edition,2009,12(3). |
| |
| Authors: | WANG Xin-qi |
| |
| Institution: | WANG Xin-qi1; 2 (1.Editorial Board; Xi an University of Arts and Science; Xi an 710065; China; 2.School of Water Resources and Hydro-electric Engineering; Xi an University of Technology; Xi an 710048; China); |
| |
| Abstract: | Kruskal algorithm and Prim algorithm are general methods for solving the minimum spanning tree.The C programming language of each one is designed in this paper,using examples to show the application of the two algorithms. |
| |
| Keywords: | minimum spanning tree graph Kruskal algorithm Prim algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
