Algorithm.

CONSTRUCT-CONSTRAINT-GRAPH

1	for all pairs of matches (A, A′) and (B, B′) in
2	do
3	ifA overlaps B
4	then type-1 arc of A → A′ and B → B′
5	elseifA is contained in B (or vice versa)
6	then type-2 arc of A → B (or B → A)
7	elseifA (and/or B) is a suspended region depending on C
8	then type-3 arc of A → C (and/or B → C)