An improved method for evaluating the network reliability based on binary decision diagrams(BDD) is presented.
To solve the structure in the effective identification of BDD subgraph isomorphism problem, the edge contraction/deletion
is applied to this decomposition process of network graphs. and the width first search algorithm of BDD is proposed. By
traversing BDD graph, the edges are sorted. A new and efficient way is provided for the Boolean function disjoint. The
experiment results show that, the algorithm has the merit of high accuracy and low time complexity, and can avoid a large
number of disjoint operations in the minimum path algorithm, which can be applied to a number of large-scale networks.