| 最小生成树算法及其应用 |
| |
| 引用本文： | 段东东. 最小生成树算法及其应用[J]. 西安航空技术高等专科学校学报, 2010, 28(1) |
| |
| 作者姓名： | 段东东 |
| |
| 作者单位： | 西安高等电力专科学校,基础部,陕西,西安,710000 |
| |
| 摘 要： | Kruskal算法和Prim算法是求最小生成树的常用算法,设计了这两种算法的C语言程序,并通过实例研究了这两种算法的实际应用价值。
|
| 关 键 词： | 最小生成树 图 Kruskal算法 Prim算法 |
Minimal Spanning Tree Algorithm & Its Application |
| |
| DUAN Dong-dong. Minimal Spanning Tree Algorithm & Its Application[J]. Journal of Xi'an Aerotechnical College, 2010, 28(1) |
| |
| Authors: | DUAN Dong-dong |
| |
| Affiliation: | DUAN Dong-dong (Department of Basic Courses,Xi'an Electric Power College,710000,Xi'an,Shaanxi,China) |
| |
| Abstract: | Kruskal and Prim are the ordinary algorithms for the computing of minimal spanning tree.The article designs C-language program of the two algorithms, and studies the application of the two algorithms through practical examples. |
| |
| Keywords: | Minimal spanning tree Kruskal Prim Algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
