| 克鲁斯卡尔(Kruskal)算法的实现与分析 |
| |
| 作者单位： | 宁夏广播电视大学 宁夏银川750002 |
| |
| 摘 要： | 克鲁斯卡尔(Kruskal)算法是实现图的最小生成树最常用的算法。本文主要介绍克鲁斯卡尔(Kruskal)算法的实现方法,并对克鲁斯卡尔(Kruskal)算法的效率进行分析。
|
| 关 键 词： | 克鲁斯卡尔(Kruskal)算法 算法实现 算法分析 |
The Realization and Analysis of Kruskal's Algorithm |
| |
| HU Zhi-qin. The Realization and Analysis of Kruskal's Algorithm[J]. Digital Community & Smart Home, 2008, 0(11) |
| |
| Authors: | HU Zhi-qin |
| |
| Abstract: | Kruskal's Algorithm is used the most frequently in constructing the minimum-cost spanning tree of the graph. The paper aims to introduce the approach to realization of Kruskal's Algorithm and makes an analysis of its efficiency. |
| |
| Keywords: | Kruskal's Algorithm realization of algorithm analysis of algorithm |
| 本文献已被 CNKI 等数据库收录！ |
