colored-matrix.cpp
Go to the documentation of this file.
463 _not_all_equal("not-all-equal", "How to implement the not all equals constraint (used in corners model)",
465 _same_or_0("same-or-0", "How to implement the same or 0 constraint (used in the decomposed no monochrome rectangle constraint)",
467 _distinct_except_0("distinct-except-0", "How to implement the distinct except 0 constraint (used in the decomposed no monochrome rectangle constraint)",
469 _no_monochrome_rectangle("no-monochrome-rectangle", "How to implement no monochrome rectangle (used in the rows model)",
495 _model.add(ColoredMatrix::MODEL_CORNERS, "corner", "Use direct corners model with not-all-equal constraints.");
496 _model.add(ColoredMatrix::MODEL_ROWS, "rows", "Use model on pairs of rows (same_or_0 and distinct_except_0 constraints).");
499 _model.add(ColoredMatrix::MODEL_COLUMNS, "columns", "Use model on pairs of columns (same_or_0 and distinct_except_0 constraints).");
506 _not_all_equal.add(ColoredMatrix::NOT_ALL_EQUAL_NAIVE, "naive", "Use naive reified decomposition.");
507 _not_all_equal.add(ColoredMatrix::NOT_ALL_EQUAL_REIFIED, "reified", "Use reified decomposition.");
514 _same_or_0.add(ColoredMatrix::SAME_OR_0_TUPLE_SET, "tuple-set", "Use tuple set representation.");
518 _distinct_except_0.add(ColoredMatrix::DISTINCT_EXCEPT_0_REIFIED, "reified", "Use reified decomposition.");
520 _distinct_except_0.add(ColoredMatrix::DISTINCT_EXCEPT_0_COUNT, "count", "Use global cardinality.");
void parse(int &argc, char *argv[])
Parse options from arguments argv (number is argc).
Definition colored-matrix.cpp:70
int distinct_except_0(void) const
Return how to implement distinct except 0.
Definition colored-matrix.cpp:95
int no_monochrome_rectangle(void) const
Return how to implement distinct except 0.
Definition colored-matrix.cpp:97
ColoredMatrixOptions(const char *n)
Initialize options for example with name n.
Definition colored-matrix.cpp:457
int not_all_equal(void) const
Return how to implement not all equals.
Definition colored-matrix.cpp:91
IntVar same_or_0(const IntVar &a, const IntVar &b)
Definition colored-matrix.cpp:186
void distinct_except_0(const IntVarArgs &v)
Definition colored-matrix.cpp:217
DFA not_all_equal_dfa(int colors)
DFA no_monochrome_rectangle_dfa(int colors)
IntSetArgs distinct_except_0_counts(int colors, int size)
void not_all_equal(const IntVarArgs &v)
Definition colored-matrix.cpp:243
void no_monochrome_rectangle(IntVarArgs v1, IntVarArgs v2)
Definition colored-matrix.cpp:287
@ NO_MONOCHROME_DECOMPOSITION
Use decomposition for no monochrome rectangle.
Definition colored-matrix.cpp:353
DFA distinct_except_0_dfa(int colors)
TupleSet same_or_0_tuple_set(int colors)
DFA same_or_0_dfa(int colors)
@ NOT_ALL_EQUAL_NQ
Use direct constraint for implementing not all equals.
Definition colored-matrix.cpp:332
@ NOT_ALL_EQUAL_REIFIED
Use reification for implementing not all equals.
Definition colored-matrix.cpp:334
@ NOT_ALL_EQUAL_NVALUES
Use nvalues for implementing not all equals.
Definition colored-matrix.cpp:335
@ NOT_ALL_EQUAL_NAIVE
Use naive reification for implementing not all equals.
Definition colored-matrix.cpp:333
void parse_strict(int &argc, char *argv[])
Parse options with strict checking (equivalent to parse() with true).
Definition options.hpp:195
static void run(const Options &opt, Script *s=nullptr)
String-valued option (integer value defined by strings).
Definition driver.hh:189
static IntArgs create(int n, int start, int inc=1)
Allocate array with n elements such that for all .
Definition array.hpp:76
Driver::ScriptBase< Driver::IgnoreStepOption< IntMinimizeSpace > > IntMinimizeScript
Base-class for scripts for finding solution of lowest integer cost.
Definition driver.hh:1009
void branch(Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf=nullptr, FloatVarValPrint vvp=nullptr)
Branch over x with variable selection vars and value selection vals.
Definition branch.cpp:39
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
Definition rel.cpp:68
void extensional(Home home, const IntVarArgs &x, DFA d, IntPropLevel ipl=IPL_DEF)
Post domain consistent propagator for extensional constraint described by a DFA.
Definition extensional-regular.cpp:39
void precede(Home home, const IntVarArgs &x, int s, int t, IntPropLevel=IPL_DEF)
Post propagator that s precedes t in x.
Definition precede.cpp:43
Gecode toplevel namespace
void count(Home home, const IntVarArgs &x, int n, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF)
Post propagator for .
Definition count.cpp:40
IntVar expr(Home home, const LinIntExpr &e, const IntPropLevels &ipls=IntPropLevels::def)
Post linear expression and return its value.
Definition int-expr.cpp:988
TieBreak< VarBranch > tiebreak(VarBranch a, VarBranch b)
Combine variable selection criteria a and b for tie-breaking.
Definition tiebreak.hpp:80
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49
void nvalues(Home home, const IntVarArgs &x, IntRelType irt, int y, IntPropLevel ipl=IPL_DEF)
Post propagator for .
Definition nvalues.cpp:40
IntVarBranch INT_VAR_SIZE_MIN(BranchTbl tbl=nullptr)
Select variable with smallest domain size.
Definition var.hpp:206
IntVarBranch INT_VAR_MIN_MIN(BranchTbl tbl=nullptr)
Select variable with smallest min.
Definition var.hpp:186
Gecode::IntArgs i({1, 2, 3, 4})
