The paper presents new concepts of the simplest path(SP) and the simplest path rooted directed tree(SPRT), introduces an algorithm looking for SPRT and computing 2-terminal reliability of RCN.

• 给出了最简路(SP)和最简路有序根树(SPRT)的概念,介绍了一个找出最简路有序根树和计算RCN2-终点可靠性的有效算法。