All-path search algorithm based on dual-stack technology
Xiaoyao Xie · Jisuanji gongcheng yu sheji · 2009
Based on the structure of the visited nodes, the not-visited nodes and belt highway, the all-path searching algorithm is designed. Adjacent table is used as a data structure, the basic information of the graph is stored, using dual-stack technology to search the all-path between any two points in the graph. Finally, not only give the proof of all-path search algorithm, but also use the data of expressway’s road network information of the Jiansu province to verify and get a correct result. The time complexity of algorithm is 2* * +2* * 4 , in the worst case.