Research on Optimal Path based on Dijkstra Algorithms
Minhang Zhou, Nina Gao
Available Online April 2019.
- https://doi.org/10.2991/icmeit-19.2019.141How to use a DOI?
- optimal path, Dijkstra algorithm, optimization.
- The optimal path selection is a practical problem, and the application frequency in daily life is very high, which has practical research significance. The Dijkstra algorithm is one of the most classical algorithms in the algorithm of optimal path selection. It is also the theoretical basis of many experimental designs when solving the optimal path problem. When the traditional Dijkstra algorithm calculates and selects the optimal path between nodes, a large number of nodes need to be calculated. The selection of the optimal path will be affected by many conditions. In the actual application, the selection conditions will often present multiple different priority conditions and comprehensive influence path selection. In this paper, the optimization algorithm is implemented and verified by experiments and practical applications.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Minhang Zhou AU - Nina Gao PY - 2019/04 DA - 2019/04 TI - Research on Optimal Path based on Dijkstra Algorithms PB - Atlantis Press SP - 884 EP - 892 SN - 2352-538X UR - https://doi.org/10.2991/icmeit-19.2019.141 DO - https://doi.org/10.2991/icmeit-19.2019.141 ID - Zhou2019/04 ER -