| Overview | Group | Tree | Graph | Deprecated | Index | Concepts |
This function creates a same-common-subsequence constraint between sequence variables
seq1 and seq2 and makes it part of the environment env.
Sequence variables seq1 and seq2 should be of the same size.
The mapping between interval variables of the two sequences is given by the order of the interval
variables in the arrays a1 and a2 used in the definition of the sequences.
The constraint states that the sub-sequences defined by seq1 and seq2
by only considering the pairs of present intervals (a1[i],a2[i]) are identical modulo the mapping
between intervals a1[i] and a2[i].
By default, the name of the constraint is the empty string, but you can specify
a name of your own choice.
Note: This constraint cannot be used in a logical constraint.
For more information on the same-common-subsequence constraint, see the concept Interval variable sequencing in CP Optimizer.
This function creates a same-common-subsequence constraint between sequence variables
seq1 and seq2 and makes it part of the environment env.
The mapping between interval variables of the two sequences is specified by arrays a1
and a2, those two arrays should be of the same size. Array a1 must only
contain interval variables of sequence seq1 without any duplicate and array a2
must only contain interval variables of sequence seq2 without any duplicate.
The constraint states that the sub-sequences defined by seq1 and seq2
by only considering the pairs of present intervals (a1[i],a2[i]) are identical modulo the mapping
between intervals a1[i] and a2[i].
By default, the name of the constraint is the empty string, but you can specify
a name of your own choice.
Note: This constraint cannot be used in a logical constraint.
For more information on the same-common-subsequence constraint, see the concept Interval variable sequencing in CP Optimizer.