An Improved Dijkstra Shortest Path Algorithm

Abstract

An improved Dijkstra shortest path algorithm is presented in this paper.The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time.The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed to adapt to different network complexity.The simulation experiment results show that the number of nodes on search shortest path and computation time is significantly reduced.Thus, improved algorithm can be faster to search out the target nodes.