Figure 3

The concept of a constraint graph. (a) A tree constraint (n _i , n _j , b _t ) of the path that connects n _i and n _j in a pedigree graph G will be transformed into an edge between n _i and n _j with weight b _t in the corresponding constraint graph G*. (b) A constraint graph. There are three edges (n₃, n₁₁), (n₇, n₅), and (n₉, n₅) in the constraint graph, which means that there are three tree constraints in the linear system. Note that the constraint graph is disconnected and contains several connected components.