A New Algorithm for Constructing Disjoint Minimal Path Set of Network
构造网络不交化最小路集的一种新算法

Constructing disjoint minimal path set is an important approach for reliability analysis of network. In this paper, based on network computation and developed from disjoint algebra and tree constructing algorithm for disjoint minimal path set, is presented a new algorithm for directly constructing disjoint minimal path set. The algorithm is simple and characterized by distributed computing, It provides a new approach for reliability analysis of large scale network system.