| 最短路径若干算法的程序实现及分析比较 |
| |
| 引用本文： | 陈中标.最短路径若干算法的程序实现及分析比较[J].贵阳金筑大学学报,2009(2):1-4. |
| |
| 作者姓名： | 陈中标 |
| |
| 作者单位： | 无锡科技职业学院; |
| |
| 摘 要： | 分别对计算最短路径的Dijkstra算法、Floyd算法、Kruskal算法进行了程序实现并且分析比较，结合实际问题说明在实际生活中应有的放矢的应用他们。
|
| 关 键 词： | Dijkstra算法 Floyd算法 Kruskal算法 程序 |
Procedural Realization and Comparative Analysis of Certain Algorithms of the Shortest Path |
| |
| Chen Zhong-biao.Procedural Realization and Comparative Analysis of Certain Algorithms of the Shortest Path[J].Journal of Jinzhu University of Guiyang,2009(2):1-4. |
| |
| Authors: | Chen Zhong-biao |
| |
| Institution: | Chen Zhong-biao(Wuxi Professional College of Science and Technology,Wuxi Jiangsu 214028,China) |
| |
| Abstract: | Carrying on the procedural realization and comparative analysis of the Dijkstra algorithm,the Floyd algorithm and the Kruskal algorithm respectively which can calculate the shortest path.These algorithms should be applied to the practical life in order to solve actual problems. |
| |
| Keywords: | Dijkstra algorithm Floyd algorithm Kruskal algorithm programme |
| 本文献已被 CNKI 维普 等数据库收录！ |
