An Algorithm for Finding All the Shortest Paths from One Node to Another in A Graph
Jianhua Shen · Jisuanji gongcheng · 2002
An algorithm for finding all the shortest paths from one node to another has been put forward. Some peculiar data structures are designed in this algorithm. The process for finding all the shortest paths from one effective node (defined below) to the extreme node is carried out only once in fact, so the efficiency of the algorithm is raised highly.In this article, some instances are provided to prove the algorithm reliable and useful.