论文部分内容阅读
利用根有向树给出一个求有效路径的算法，从而得到一个计算多级互联网络可靠度的简捷方法。求网络可靠度时，该算法的计算量和文献[1]中算法相当；而求两终端可靠度时，计算量是文献[1]中算法的2／N倍（这里N是MIN的输入站或输出站的数目）；求K－终端可靠度时，计算量也要比文献[1]中算法小。因此本文算法是一个计算多级互联网络可靠度的一个有效算法。
A root-oriented tree is used to find an algorithm to find the effective path, so as to obtain a simple and convenient method to calculate the reliability of multi-level interconnected networks. When calculating the network reliability, the computational complexity of this algorithm is equivalent to the algorithm in literature [1]. When calculating the reliability of two terminals, the computational cost is 2 / N times of the algorithm in [1] Or the number of output stations). When calculating the K-terminal reliability, the calculation amount is smaller than the algorithm in [1]. Therefore, this algorithm is an effective algorithm to calculate the reliability of multi-level Internet.