A kth-shortest Path Algorithm Based on k-1 Shortest Paths
Fenglin Guo · Wuhan Daxue xuebao. Xinxi kexue ban · 2009
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.