Berechnung der Zuverlaessigkeit von Netztopologien(Reliability of Network Topologies, ReNeT) 
Heidtmann,
1997, developed an algorithm to compute the probability that
the nodes of a subset of all nodes of a given network topology are connected
by decomposing this event into a union of events which are disjoint and
whose probabilities can be sumed up. The advantage of this method is that
it produces much less disjoint terms than other methods and that it is
therefore much more effective (For a comparison with other methods see ReNeTComp).
Xiang developed an applet to demonstrate that algorithm. You will be able to input your network model by drawing a graph and defining the probability of every edge of the network. The network will be firstly reduced by eliminating serial and parallel edges and then the reduced network will be decomposed with Heidtmann's method. Finally the reliability of the network (i.e. the probability the nodes of a subset K of all network nodes are connected) will be calculated and output.

Heidtmann's algorithm:
(for monoton systems only) Procedure HEIDTMANNZERLEGUNG(I(0),I(1),...,I(k),i)
if HI(i)¹ {} then

