Heuristic depth-first directional algorithm for shortest path searching in traffic networks
Fang Xiu Jia · Journal of Zhejiang University(Science Edition) · 2013
For a large traffic network that contains a great amount of nodes,an improved algorithm based on depthfirst search is figured out.In the searching process,the algorithm firstly selects nodes according to the direction,which can largely decreases the searching area.Meanwhile,a heuristic function to calculate the value of each node is introduced and the search by choosing the node with the lowest value is extended,which improves the efficiency of depth-first search.Hence,the algorithm not only can find the shortest routine in the early time,but also provides users with some more routines in support.