Optimization Studies Based on Shortest Path Algorithm of Dijkstra
Jian Li · 2009
The shortest path problem is an important issue of graph theory.Dijkstra algorithm is a theoretical basis to solve many engineering problems of the shortest path and has a wide range of applications.This paper,on the basis of analysis of the traditional Dijkstra algorithm,proposes some inadequacies of the algorithm implementation,in order to improve some aspects of the conservation storage space and operational efficiency.With analysis and comparison,algorithm of efficiency improved is superior to the traditional Dijkstra algorithm and has a good application.