Fig. 4.
(Left) chain graphs (Gh) from the compass graph in Figure 1. The level corresponding to edges in GC are denoted by black (non-tree edges) and blue (spanning tree edges) lettering above the vertices. In this example, the edge phasing probabilities in GC are all 1. So, an edge connecting level i to level j which is in b disjoint path solutions will receive a weight of b/d if there are d unique disjoint path solutions from level i to level j. The weights of edges calculated from disjoint siti paths in each Gh are added to the Gg (right).