BAI Yiduo, HU Peng, XIA Lanfang, GUO Fenglin. A kth-shortest Path Algorithm Based on k-1 Shortest Paths[J]. Geomatics and Information Science of Wuhan University, 2009, 34(4): 492-494.
Citation:
BAI Yiduo, HU Peng, XIA Lanfang, GUO Fenglin. A kth-shortest Path Algorithm Based on k-1 Shortest Paths[J]. Geomatics and Information Science of Wuhan University, 2009, 34(4): 492-494.
BAI Yiduo, HU Peng, XIA Lanfang, GUO Fenglin. A kth-shortest Path Algorithm Based on k-1 Shortest Paths[J]. Geomatics and Information Science of Wuhan University, 2009, 34(4): 492-494.
Citation:
BAI Yiduo, HU Peng, XIA Lanfang, GUO Fenglin. A kth-shortest Path Algorithm Based on k-1 Shortest Paths[J]. Geomatics and Information Science of Wuhan University, 2009, 34(4): 492-494.
A kth-shortest Path Algorithm Based on k-1 Shortest Paths
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.
DownLoad: