(Revision: 10684)
Go to the source code of this file.
Namespaces |
namespace | Gecode |
| Gecode toplevel namespace
|
namespace | Gecode::Int |
| Finite domain integers.
|
namespace | Gecode::Int::GCC |
| Global cardinality propagators (Counting)
|
Functions |
template<class Card > |
ExecStatus | Gecode::Int::GCC::prop_card (Space &home, ViewArray< IntView > &x, ViewArray< Card > &k) |
| Bounds consistency check for cardinality variables.
|
template<class Card > |
bool | Gecode::Int::GCC::card_consistent (ViewArray< IntView > &x, ViewArray< Card > &k) |
| Consistency check, whether the cardinality values are feasible.
|
Path compression |
Each of the nodes on the path from start to end becomes a direct child of to.
|
void | Gecode::Int::GCC::pathset_ps (HallInfo hall[], int start, int end, int to) |
| Path compression for potentially stable set structure.
|
void | Gecode::Int::GCC::pathset_s (HallInfo hall[], int start, int end, int to) |
| Path compression for stable set structure.
|
void | Gecode::Int::GCC::pathset_t (HallInfo hall[], int start, int end, int to) |
| Path compression for capacity pointer structure.
|
void | Gecode::Int::GCC::pathset_h (HallInfo hall[], int start, int end, int to) |
| Path compression for hall pointer structure.
|
Path minimum |
Returns the smalles reachable index starting from i.
|
int | Gecode::Int::GCC::pathmin_h (const HallInfo hall[], int i) |
| Path minimum for hall pointer structure.
|
int | Gecode::Int::GCC::pathmin_t (const HallInfo hall[], int i) |
| Path minimum for capacity pointer structure.
|