Resolution:
## Figure 3.
The concept of a constraint graph. (a) A tree constraint (n) of the path that connects _{i}, n_{j}, b_{t}nand _{i }nin a pedigree graph _{j }G will be transformed into an edge between nand _{i }nwith weight _{j }bin the corresponding constraint graph _{t }G*. (b) A constraint graph. There are three edges (n_{3}, n_{11}), (n_{7}, n_{5}), and (n_{9}, n_{5}) 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.
Lai |