Figure 4
From: A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree
All possible appearances of a local cycle in a locus graph. The dotted line represents the non-tree edge e. (a) The local cycle appears with cycle constraint (b c , e). (b) There is only one path containing e with path constraint (n c , n d , b p , e). (c) There is only one path with tree constraint (n c , n d , b t ). (d) There are only four predetermined nodes without any constraint.