A technique is proposed by which all paths of exactlyqbranches 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 anNmatrix which is a modified version of the vertex adjacency matrix.