Network reliability is defined as the ability of a network to carry out a desired operation. The enumeration of the minimal paths is one of the methods that can be used to evaluate the reliability of any system that can be modeled as a network. In this paper, we will present a new algorithm for the enumeration of minimal paths in the network. Our method is based on two parallel explorations, one from the source and the other from the sink. In other words, the exploration of each path of the network is done level by level starting from the terminal nodes (source and sink). 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. This technique will allow us to reduce the execution time because at each iteration, instead of progressing at each time by one edge as in the algorithms of the literature, we progress by two edges.
Volume 12 | 04-Special Issue
Pages: 1101-1113
DOI: 10.5373/JARDCS/V12SP4/20201584