本文所提之ALL(1)演算法是由著名ALR及ALW演算法藉由項數排列改良而成。先將網路輸入路徑以布林函數表示，將所有路徑利用特殊排列方式排列，套用向農展開式再經過布林函數的演算法後可得到最少且互不相交的SDP項。本文利用程式撰寫的方式完成ALL(1)演算法，更綜合ALL(1)演算法及ALW演算法兩者之優點，得出ALL(2)演算法。並舉例出數個2位元同調網路與二種獲得最少項之ALR，ALW演算法做比較其項數與CPU時間，所得的項數會較之前二種方法爲少，證實ALL(2)演算法亦爲求網路系統可靠度SDP最少項數的方法。
This paper presents two new methods, the ALL (1) and ALL (2) algorithm, for calculating the network system reliability by sum of disjoint products (SDP). The input data are the minimal paths of a binary coherent network. The main feature of the ALL (1) and ALL (2) see their ability to properly arrange the order of minimal paths, so they may generate shorter disjoint products than any other known SDP method. Examples are given to illustrate how the ALL (1) and ALL (2) algorithms should be far better than ALR&ALW methods in terms of computation time and the number of SDP terms.
