On the Algorithms in Calculating the Shortest Path
Ya Zhang
Abstract
Ya Zhang
Abstract
We give a brief introduction to the graph model,the classification of the shortest-path issue and elaborate on the commonly used algorithms: Dijkstra algorithm,Floyd algorithm and Ford algorithm. Emphasis has been put on the application of Dijkstra algorithm in transit network. We have also introduced the applications of the shortest-path algorithm in other areas.
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.
We give a brief introduction to the graph model,the classification of the shortest-path issue and elaborate on the commonly used algorithms: Dijkstra algorithm,Floyd algorithm and Ford algorithm. Emphasis has been put on the application of Dijkstra algorithm in transit network. We have also introduced the applications of the shortest-path algorithm in other areas.
Key concepts: Yen's algorithm, Dijkstra's algorithm, Shortest Path Faster Algorithm, K shortest path routing, Shortest path problem, Pathfinding, Suurballe's algorithm, Algorithm