关于网络的终端可靠度的新算法

类比Ｄｏｄｔｓｏｎ与Ｇｏｂｉｅｎ［１］提出的算法，给出网络的终端可靠度的一种新算法，提出了Ｒｓ－ｔ的选边原则，使得算法过程中产生的项在遇到含有道路或割集时，则停止生长，而继续其它的分支，不必枚举出所有道路或割集，使得Ｒｓ－ｔ的表达式中的项数和过程中产生的项数减少，表达式更加紧凑，运算更快。通过对计算结果的比较，可以看到本文算法对较大的网络有着很大意义。

A New Algorithm of the Network Terminal Reliability

By drawing an analogy with the arithmetic operations of Dodtson and Gobien, this paper suggests a new algorithm of the network terminal reliability and the principle of selecting edge Rs-t. This new algorithm can stop the growth of the produced terms during arithmetic operation, when they come to roads and cutset, and go on with other branches with no need to list all the roads and cutset. In this case the terms in the expression of Rs-t and the terms produced in arithmetic operation are reduced, which makes the expression more compact and calculation quicker. By comparison of calculation results, the algorithm suggested in this paper shows obvious significance for wider networks.