Class PropAntiArborescences
- java.lang.Object
-
- org.chocosolver.solver.constraints.Propagator<IntVar>
-
- org.chocosolver.solver.constraints.nary.tree.PropAntiArborescences
-
- All Implemented Interfaces:
Comparable<Propagator>,ICause,Identity
public class PropAntiArborescences extends Propagator<IntVar>
AntiArborescences propagation (simplification from tree constraint) based on dominators loops (i.e., variables such that x[i]=i) are considered as roots Can use the simple LT algorithm which runs in O(m.log(n)) worst case time Or a slightly more sophisticated one, linear in theory but not necessarily faster in practice- Author:
- Jean-Guillaume Fages
-
-
Field Summary
-
Fields inherited from class org.chocosolver.solver.constraints.Propagator
constraint, model, priority, reactToFineEvt, vars
-
-
Constructor Summary
Constructors Constructor Description PropAntiArborescences(IntVar[] succs, int offSet, boolean linear)AntiArborescences propagation (simplification from tree constraint) based on dominators
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description ESatisEntailed()Check wetherthisis entailed according to the current state of its internal structure.voidpropagate(int evtmask)Call the main filtering algorithm to apply to theDomainof theVariableobjects.-
Methods inherited from class org.chocosolver.solver.constraints.Propagator
addVariable, arity, compareTo, doFinePropagation, doFlush, doSchedule, doScheduleEvent, dynPriority, equals, fails, forcePropagate, forcePropagationOnBacktrack, getConstraint, getId, getModel, getNbVars, getPosition, getPriority, getPropagationConditions, getVar, getVars, getVIndice, getVIndices, hashCode, isActive, isCompletelyInstantiated, isPassive, isReifiedAndSilent, isStateLess, linkVariables, propagate, reactToFineEvent, setActive, setPassive, setPosition, setReifiedSilent, setReifiedTrue, setVIndices, toString, unlinkVariables, unschedule, why
-
-
-
-
Constructor Detail
-
PropAntiArborescences
public PropAntiArborescences(IntVar[] succs, int offSet, boolean linear)
AntiArborescences propagation (simplification from tree constraint) based on dominators- Parameters:
succs- array of integer variablesoffSet- intlinear- boolean
-
-
Method Detail
-
propagate
public void propagate(int evtmask) throws ContradictionExceptionDescription copied from class:PropagatorCall the main filtering algorithm to apply to theDomainof theVariableobjects. It considers the current state of this objects to remove some values from domains and/or instantiate some variables. Calling this method is done from 2 (and only 2) steps:
- at the initial propagation step,
- when involved in a reified constraint.
It should initialized the internal data structure and apply filtering algorithm from scratch.- Specified by:
propagatein classPropagator<IntVar>- Parameters:
evtmask- type of propagation eventthismust consider.- Throws:
ContradictionException- when a contradiction occurs, like domain wipe out or other incoherencies.
-
isEntailed
public ESat isEntailed()
Description copied from class:PropagatorCheck wetherthisis entailed according to the current state of its internal structure. At least, should check the satisfaction ofthis(when all is instantiated).- Specified by:
isEntailedin classPropagator<IntVar>- Returns:
- ESat.TRUE if entailed, ESat.FALSE if not entailed, ESat.UNDEFINED if unknown
-
-