- Origin
Gecode
- Constraint
-
- Synonym
.
- Arguments
| |
| |
| |
- Restrictions
|
|
|
|
|
|
|
|
- Purpose
Enforce each vertex of a digraph to have exactly one
predecessor and one successor.
In addition the following two statements are equivalent:
The successor of the node minus is equal to .
The predecessor of the node minus is equal to .
I.e.,Β .
- Example
-
The constraint holds since:
,
,
,
,
.
.
.
.
FigureΒ 5.171.1 shows the board that can be associated with this example.
- Typical
|
|
|
|
|
- Symmetry
Items of are permutable.
- Remark
The constraint is called in
Gecode
(http://www.gecode.org/). Having two offsets was motivated
by the fact that it is possible to declare arrays at any position in the MiniZinc
modelling language.
- Systems
inverseChanneling in Choco,
channel in Gecode.
- See also
specialisation:
Β (assume that and are both equal to 0).
- Keywords
constraint type:
graph constraint.
filtering:
arc-consistency.
heuristics:
heuristics.
modelling:
channelling constraint,
dual model.