An Kai
Abstract
Dijkstra's algorithm of solving the shortest path problem of weighted directed graph is still regarded as the best one.However its weakness is that it can not be used to solve the shortest path problem with some negative weights.A new algorithm,called method of forward graph,can take as a saving method.
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.
Dijkstra's algorithm of solving the shortest path problem of weighted directed graph is still regarded as the best one.However its weakness is that it can not be used to solve the shortest path problem with some negative weights.A new algorithm,called method of forward graph,can take as a saving method.
Key concepts: Shortest path problem, Yen's algorithm, Shortest Path Faster Algorithm, Suurballe's algorithm, Widest path problem, Dijkstra's algorithm, Algorithm, K shortest path routing