Novel reliability measures tailored for stochastic graphs with designated source vertices and failure-probability-weighted edges called Path Survival Reliabilities that pertain to:
- A per-vertex reliability measure quantifying the average survival likelihood of single-source paths from a vertex to any source
- An overall reliability measure incorporating the graph density and the shortest distance to a source as regulating elements
make
./pszdd <edgelist> <sources> [ <options>... ]
./pszdd Graphs/kobe.dat Graphs/kobe_s.dat
Example:
1 2 0.9
1 3 0.8
2 3 0.5
<edgelist> specifies the edges of the network with their attributes. Each line starts with the two vertices corresponding to the endpoints of the edge. This is followed by the probability of non-failure for the edge. The edge length and edge capacity follow if the flag len and cap are used, respectively.
Example:
1 3
<sources> specifies the source vertices in the network.