Pathfinding through a communication network
I.M. Paz · Proceedings of the Institution of Electrical Engineers · 1967
A technique is proposed by which all paths of exactly q branches interconnecting a given source-sink node pair can be obtained. Using the proposed technique, paths of increasing length can be found sequentially. The method is based on a symbolic noncommutative multiplication among the entries of an Nmatrix which is a modified version of the vertex adjacency matrix.