Domain consistent distinct propagator. More...
#include <distinct.hh>
Public Member Functions | |
virtual ExecStatus | propagate (Space &home, const ModEventDelta &med) |
Perform propagation. | |
virtual PropCost | cost (const Space &home, const ModEventDelta &med) const |
Cost function. | |
virtual Actor * | copy (Space &home, bool share) |
Copy propagator during cloning. | |
Static Public Member Functions | |
static ExecStatus | post (Home home, ViewArray< View > &x) |
Post propagator for views x. | |
Protected Member Functions | |
Dom (Space &home, bool share, Dom< View > &p) | |
Constructor for cloning p. | |
Dom (Home home, ViewArray< View > &x) | |
Constructor for posting. | |
Protected Attributes | |
DomCtrl< View > | dc |
Propagation controller. |
Domain consistent distinct propagator.
The propagator uses staging: first it uses naive value-based propagation and only then uses domain consistent propagation.
The algorithm is taken from: Jean-Charles Régin, A filtering algorithm for constraints of difference in CSPs, Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 362--367. Seattle, WA, USA, 1994.
Requires
#include <gecode/int/distinct.hh>
ExecStatus Gecode::Int::Distinct::Dom::propagate | ( | Space & | home, |
const ModEventDelta & | med | ||
) | [virtual] |
PropCost Gecode::Int::Distinct::Dom::cost | ( | const Space & | home, |
const ModEventDelta & | med | ||
) | const [virtual] |
Cost function.
If in stage for naive value propagation, the cost is low linear. Otherwise it is high quadratic.
Reimplemented from Gecode::NaryPropagator< View, PC_INT_DOM >.
ExecStatus Gecode::Int::Distinct::Dom::post | ( | Home | home, |
ViewArray< View > & | x | ||
) | [static] |
DomCtrl<View> Gecode::Int::Distinct::Dom::dc [protected] |
Propagation controller.
Definition at line 255 of file distinct.hh.