网络中寻找所有最小路的一个改进的递归算法.pdfVIP

Reliability Engineering and System Safety 150 (2016) 1–10 Contents lists available at ScienceDirect Reliability Engineering and System Safety journal homepage: /locate/ress An improved algorithm for finding all minimal paths in a network Guanghan Bai, Zhigang Tian n, Ming J. Zuo Department of Mechanical Engineering, University of Alberta, Edmonton, Canada a r t i c l e i n f o a b s t r a c t Article history: Minimal paths (MPs) play an important role in network reliability evaluation. In this paper, we report an Received 20 September 2015 efficient recursive algorithm for finding all MPs in two-terminal networks, which consist of a source node Received in revised form and a sink node. A linked path structure indexed by nodes is introduced, which accepts both directed and 5 January 2016 undirected form of networks. The distance between each node and the sink node is defined, and a simple Accepted 8 January 2016 recursive algorithm is presented for labeling the distance for each node. Based on the distance between Available online 1 February 2016 each node and the sink node, additional conditions for backtracking are incorporated to reduce the Keywords: number of search branches. With the newly introduced linked node structure, the distances between Minimal path each node and the sink node, and the additional backtracking conditions, an