Algorithm for Solving the Shortest Path in Network with Recursive Backtracking
Yang Yuan-fa · Jisuanji gongcheng · 2005
An algorithm is presented for solving the shortest path in network by labeling the distance between start point and current exploring point with recursive backtracking maze search. The algorithm is very well suit to solving the shortest path problem in complex network or in complex maze, and gives an interested solution which contains information such as route label and the shortest path between start point and any connected point, and shows less time complexity when applied to solve an undirected weighted graph than Dijkstra’ algorithm did, and may be a breakthrough for time complexity and space complexity in solving maze by traditional algorithm.