Random Depth-first Search Algorithm used in optimal path problem of large transport network
Chao Zhang · Railway Computer Application · 2009
Wused random depth-first search algorithm to solve optimal path problem of large-scale transport network. We applied the algorithm to the transport network with more than 4,000 stations and 520 lines ,which have achieved success. Random depth-first search algorithm can find an excellent solution in 2000ms.