Designing and Achieving Web Service for All Paths from One Vertex to the Other
Zhao Fu-sheng · Journal of Yangtze University · 2013
In this article,an algorithm for finding all paths from one vertex to the other is put forward,all the paths arrange from small to largeone according to the weight of path.The algorithm first uses path tree to find all paths.All paths are saved in proper position of pointer array.The Web service is designed for all paths.The result of Web service shows that the algorithm is feasible,correct and effective.