Fenglin Guo
Abstract
k shortest paths include the shortest one,the second shortest one,the third shortest one,and soon.After analyzed k shortest paths problems with graph theory,the kth-shortest path algorithm was designed and analyzed based on k-1 shortest paths.The algorithm is more efficient than others.
OpenAlex reports 2 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.
k shortest paths include the shortest one,the second shortest one,the third shortest one,and soon.After analyzed k shortest paths problems with graph theory,the kth-shortest path algorithm was designed and analyzed based on k-1 shortest paths.The algorithm is more efficient than others.
Key concepts: K shortest path routing, Yen's algorithm, Shortest Path Faster Algorithm, Shortest path problem, Constrained Shortest Path First, Euclidean shortest path, Floyd–Warshall algorithm, Distance