When multiple preordering candidates are available, we merge them into a single graph structure.
we integrate nodes in two preordering lattices if their nodes have same coverage vectors each other as shown in Figure 1(  end for 10: 14:  Figure 1(c) shows an example of merging 5 preordering candidates in A as a single preordering lattice.