| Dijkstra算法的优化 |
| |
| 引用本文： | 遇娜,简广宁.Dijkstra算法的优化[J].天津职业院校联合学报,2011,13(2):89-91. |
| |
| 作者姓名： | 遇娜 简广宁 |
| |
| 作者单位： | 1. 天津市红桥区职工大学,天津市,300131
2. 天津城市建设学院,天津市,300384 |
| |
| 摘 要： | Dijkstra算法是许多工程解决最短路径问题的理论基础,可用来找出图中指定节点到其他节点的最短距离,有着广泛的应用。文章通过分析传统Dijkstra算法的设计思想,提出该算法在实现方法上存在的一些不足之处,并从节约存储空间和提高运算效率方面对其进行了改进,并通过复杂性分析比较,得出这种改进算法的效率优于传统的Dijkstra算法。
|
| 关 键 词： | 最短路径 Dijkstra算法 邻接表 堆排序 |
The Optimization of Dijkstra Algorithm |
| |
| YU Na,JIAN Guang-ning.The Optimization of Dijkstra Algorithm[J].Journal of Tianjin Vocational Institutes,2011,13(2):89-91. |
| |
| Authors: | YU Na JIAN Guang-ning |
| |
| Institution: | YU Na1,JIAN Guang-ning2(1.Tianjin Hongqiao District Staff and Workers University,Tianjin 300131 China,2.Tianjin Urban Construction Institute,Tianjin 300384 China) |
| |
| Abstract: | Dijkstra algorithm is used to find the shortest path between various nodes at the right value in a given graph.In many projects it serves as the rationale for solving the shortest path problem.On the basis of an analysis of traditional Dijkstra algorithm's design philosophy,the paper presents some of its defects in implementation and puts forward some suggestions for improvement for the purpose of saving memory space and increasing efficiency.Furthermore,by comparison of their complexity analysis,it proves ... |
| |
| Keywords: | shortest path Dijkstra algorithm adjacency list heap sort |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
