An efficient method for terminal and multiterminal pathset enumeration

The literature is abundant with algorithms for determining separately the paths for the single terminal pair, paths for multiterminal pairs and cuts for a specified terminal pair of any network, from knowledge of the reliability logic diagram (RLD). However, very few methods are available as efficient algorithms for enumerating simultaneously the paths between any single terminal pair, paths for multiterminal pairs and cuts for the specified terminal pair.The present paper provides a conceptually simple and computationally efficient algorithm to obtain simultaneously the paths between any single pair of terminals, paths for multiterminal pairs and the cuts for the specified terminal pair of interest of any complex network. The algorithm is easy and computationally economical and also applicable to graphs having both nodes and branches of finite non-zero failure probability.An illustrative example is provided to demonstrate the effectiveness of the proposed algorithm.