| 经典Dijkstra算法及其改进的分析比较 |
| |
| 引用本文： | 张晓玲. 经典Dijkstra算法及其改进的分析比较[J]. 科技信息, 2009, 0(27): 170-171 |
| |
| 作者姓名： | 张晓玲 |
| |
| 作者单位： | 郑州铁路职业技术学院管理工程系; |
| |
| 摘 要： | 本文对经典Dijkstra算法进行了介绍并分析其优劣，针对其存储量大和计算量大的缺陷，列举了两种改进算法的算法思想和实现步骤。
|
| 关 键 词： | Dijkstra算法 最短路径 比较 |
Classics Dijkstra Algorithm and Improvement Analysis Comparison |
| |
| ZHANG Xiao-ling. Classics Dijkstra Algorithm and Improvement Analysis Comparison[J]. Science, 2009, 0(27): 170-171 |
| |
| Authors: | ZHANG Xiao-ling |
| |
| Affiliation: | Zhengzhou Railway Vocation Technology College;Zhengzhou Henan;450052 |
| |
| Abstract: | This article carried on to the classics Dijkstra algorithm introduced and analyzes its fit and unfit quality, in view of its great reserves and big computation load flaw, has enumerated two kind of improvement algorithm algorithm thought and realizes the step. |
| |
| Keywords: | Dijkstra algorithm Most short-path Compare |
| 本文献已被 CNKI 维普 等数据库收录！ |
