Xiao Wang
Abstract
This paper discusses the design and implementation strategies of the famous Dijkstra shortest paths algorithm. The new techniques suggested improve the time and space complexities of the shortest paths algorithm significantly.
A significance statement is not available in the OpenAlex record.
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 discusses the design and implementation strategies of the famous Dijkstra shortest paths algorithm. The new techniques suggested improve the time and space complexities of the shortest paths algorithm significantly.
Key concepts: Dijkstra's algorithm, K shortest path routing, Shortest Path Faster Algorithm, Yen's algorithm, Shortest path problem, Computer science, Floyd–Warshall algorithm, Algorithm