The Optimization of Dijkstra Algorithm
Jian Guang-ning · Journal of Tianjin Vocational Institutes · 2011
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 that the improved algorithm is superior to the traditional one in efficiency.