A new algorithm in enumerating all minimal paths in a sparse network

In this paper an efficient algorithm is proposed that generates all minimal paths in a sparse network. When we analyze a complex network reliability, it is important to enumerate all minimal paths. The DFS algorithm is the well-known method for enumerating all minimal paths. Shen has provided a DFS algorithm that is simple and easy to program. Our proposed algorithm is composed of Shenʹs algorithm and some additional processes. Computational results show that our algorithm is more efficient than Shenʹs for many sparse networks.