Zhang Jian-ye
Abstract
In this paper,a new algorithm to solve the shortest path problem of weighted graph is advanced.It remedies the defect of Dijkstra's algorithm, which can not be used to solve the shortest path problem with some negative weights.
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.
In this paper,a new algorithm to solve the shortest path problem of weighted graph is advanced.It remedies the defect of Dijkstra's algorithm, which can not be used to solve the shortest path problem with some negative weights.
Key concepts: Shortest path problem, Yen's algorithm, Shortest Path Faster Algorithm, Dijkstra's algorithm, K shortest path routing, Widest path problem, Euclidean shortest path, Pathfinding