Value precedence constraints over set variables
[Using finite integer sets]
Functions | |
void | Gecode::precede (Home home, const SetVarArgs &x, int s, int t) |
Post propagator that s precedes t in x. | |
void | Gecode::precede (Home home, const SetVarArgs &x, const IntArgs &c) |
Post propagator that successive values in c precede each other in x. |
Function Documentation
void Gecode::precede | ( | Home | home, | |
const SetVarArgs & | x, | |||
int | s, | |||
int | t | |||
) |
Post propagator that s precedes t in x.
This constraint enforces that if there exists such that , then there exists such that .
void Gecode::precede | ( | Home | home, | |
const SetVarArgs & | x, | |||
const IntArgs & | c | |||
) |
Post propagator that successive values in c precede each other in x.