Research of shortest path algorithm based on the data structure

The shortest path problem based on the data structure has become one of the hot research topics in graph theory. As the basic theory of solving this problem, Dijkstra algorithm has been widely used in engineering calculations. Aiming at the shortcomings of traditional Dijkstra algorithm, this paper has proposed an optimization method which has mainly improved the nodes selection of the shortest path and data storage structure and organization. Through comparison and analysis, the improved algorithm has been obtained, which has reduced the storage space, improved the operational efficiency and has a better applicability in the shortest path calculation.