This paper proposes a novel recursive algorithm, towards finding all routing paths in an unidirectional flow- network.
The algorithm is recursive, so it provides a flexible approach comparing to iterative methods. Initially, all the paths from
source to destinations are identified and represented in a two-dimensional matrix. The recursive algorithm uses the
concept of blanking patterns, by identifying definite patterns of combinations of rows and columns in the two-dimensional