Using finite domain integers
[Interfacing to Gecode]
Collaboration diagram for Using finite domain integers:
|
Modules | |
| Integer variables | |
| Argument arrays | |
| Variable arrays | |
| Domain constraints | |
| Simple relation constraints | |
| Equality constraints | |
| Element constraints | |
| Distinct constraints | |
| Channel constraints | |
| Scheduling constraints | |
| Regular constraints | |
| Sorting constraints | |
| Cardinality constraints | |
| Boolean constraints | |
| Arithmetic constraints | |
| Linear constraints | |
| Branching | |
| Assigning | |
Enumerations | |
| enum | Gecode::IntRelType { Gecode::IRT_EQ, Gecode::IRT_NQ, Gecode::IRT_LQ, Gecode::IRT_LE, Gecode::IRT_GQ, Gecode::IRT_GR } |
| Common relation types for integers. More... | |
| enum | Gecode::IntConLevel { Gecode::ICL_VAL, Gecode::ICL_BND, Gecode::ICL_DOM, Gecode::ICL_DEF } |
| Consistency levels for integer propagators. More... | |
Enumeration Type Documentation
|
|
Common relation types for integers.
|
). 
). 
). 
). 
). 
).
|
|
Consistency levels for integer propagators. The descriptions are meant to be suggestions. It is not required that a propagator achieves full domain-consistency or full bounds-consistency. It is more like: which level of consistency comes closest. If in the description of a constraint below no consistency level is mentioned, the propagator for the constraint implements domain-consistency. |