An algorithm to find all paths between two nodes in a graph
In this note the authors present an algorithm for finding all the paths between two nodes in a graph. The algorithm is a well-known application of the depth-first search strategy and the authors report on some simulations they performed (on aqueous systems) using several kinds of computer systems.
finding all the paths between two nodes in a graph
scientific article; zbMATH DE number 4154482