A study on algorithm of all paths for directed graph with nonnegative weights
Hong Jiang · Journal of Changchun University · 2009
Directed graph routing problem has extensive application,in which an algorithm of solving shortest path is classic.K-shortest path algorithm has widely been studied,but algorithm for selecting all feasible paths is very limited.This paper gives a search algorithm of all feasible paths for directed graph without negative weights and discusses the complexity of both time and space of the algorithm.