An implementation of the Buzacott algorithm for network global-reliability

This study presents an implementation of the Buzacott algorithm (1980), and is based on a sequence-generating algorithm that lends itself to a simple computational procedure to locate probability values at any computation. A comparison made with the polychain algorithm on various network-sizes shows that polychain outperformed the algorithm presented by J.A. Buzacott (1980) by several orders of magnitude on sparse networks. The Buzacott algorithm outperformed polychain on fully connected and on dense, but less than fully connected, networks. A complexity model of the implementation is given