Fig. 1
From: Shortest path counting in probabilistic biological networks
A probabilistic network \(\mathcal {G}\) (a), its two possible deterministic network topologies G1 and G2 (b,c) and a sample bipartite graph between nodes a and d (d) are shown. The bipartite graph \(\mathcal {G}_{a,d}\) models the dependency between paths connecting nodes a and d in the probabilistic graph shown in (a). H1, H2, H3, H4 and H5 are the simple paths between a and d. Collectively these paths yield seven edges, which are {e1=(a,d),e2=(b,c), e3=(b,d),e4=(a,c),e5=(c,e),e6=(b,e),e7=(e,d)}