On Finding the Paths Through a Network
Neil J.A. Sloane · Bell System Technical Journal · 1972
Given a directed graph G, algorithms are discussed for finding (i) all paths through G with prescribed originating and terminating nodes, (ii) a subset of these paths containing all the edges, (iii) a subset containing all the edge-edge transitions, and (iv) a subset containing the most likely paths.