New and efficient method to find all minimal paths

A general method for network reliability evaluation is using minimal paths. This paper presents a new technique for enumerating all minimal paths in a network (oriented or not, has a loop or parallel links). This new technique is based on exploring the networks from two nodes, one from the source s and the other from the sink t. The algorithm is starting from the two terminal nodes (source s and sink t). At each iteration, we test if there is a connection between the last node of traversal that started from the source and the last node of traversal that started from the sink. The execution time for finding all the minimal paths will be reduced, because this technique will allow us to progress at each time by two edges, instead of progressing by one edge like the algorithms of the literature.