Paper
15 October 2021 Improved Dijkstra algorithm based on a new storage method
Junjie Wang, Yingqiao Liu, Bo Tang, Xiaoling Jin, Yang Xiao
Author Affiliations +
Proceedings Volume 11933, 2021 International Conference on Neural Networks, Information and Communication Engineering; 119330A (2021) https://doi.org/10.1117/12.2615295
Event: 2021 International Conference on Neural Networks, Information and Communication Engineering, 2021, Qingdao, China
Abstract
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.
© (2021) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Junjie Wang, Yingqiao Liu, Bo Tang, Xiaoling Jin, and Yang Xiao "Improved Dijkstra algorithm based on a new storage method", Proc. SPIE 11933, 2021 International Conference on Neural Networks, Information and Communication Engineering, 119330A (15 October 2021); https://doi.org/10.1117/12.2615295
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithms

Optimization (mathematics)

Computer simulations

Internet

Roads

Stars

Information security

Back to Top