Induction based replicative patterns algorithm for routing analysis in unidirectional flow networks

This paper propose a novel, induction based replicative patterns algorithm towards searching all routes in a unidirectional flow network. The fundamental approach is to generate all paths from a source node to sink node (destination node), represented in a two-dimensional matrix applying the proposed induction based on replicative patterns of matrix cells. It is found that, by starting a network with node size three, a matrix with all routes of any network size can be arrived. The proposed algorithm effectively provides list of all routes in any unidirectional flow networks with only data of the number of nodes in the network. The algorithm apply the concept of iterative blanking of replicative patterns, which are generated by definite combination of rows and columns in a two dimensional matrix.