LI Zhi-yong
Abstract
This paper proposed an optimal Dijkstra algorithm which adopted the structure of binary heap and network side storage structure model.The experimental result proves that the optimal algorithm is effective and the logistics center location can obtain a satisfactory scheme by adopting the algorithm.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper proposed an optimal Dijkstra algorithm which adopted the structure of binary heap and network side storage structure model.The experimental result proves that the optimal algorithm is effective and the logistics center location can obtain a satisfactory scheme by adopting the algorithm.
Key concepts: Dijkstra's algorithm, Computer science, Algorithm, A* search algorithm, Heap (data structure), Pathfinding, Suurballe's algorithm, Shortest path problem