Improved Dijkstra algorithm based on a new storage method
Junjie Wang, Yingqiao Liu, Bo Tang, Xiaoling Jin, Yang Xiao · 2021
Shortest path algorithm is the basis of many optimization problems such as resource allocation and optimal path planning. It is very meaningful to study the shortest path algorithm, because it can reflect the efficiency. We propose an improved Dijkstra algorithm based on a new storage method, which improves the shortcomings of the Dijkstra algorithm to a certain extent by constructing the map of the forward star by the chain. The experimental results show that our improved algorithm is more effective than the classical algorithm. We provide an effective method for the analysis and application of actual large graph theory problems.