|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of RemovalsAdvisor in choco.cp.solver.constraints.global.tree.filtering |
---|
Fields in choco.cp.solver.constraints.global.tree.filtering declared as RemovalsAdvisor | |
---|---|
protected RemovalsAdvisor |
FilteringAdvisor.propagateStruct
object that record the infeasible values in the different domains of the variables involved in the constraint |
protected RemovalsAdvisor |
AbstractPropagator.propagateStruct
structure that manage removals |
Uses of RemovalsAdvisor in choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.globalCardConstraint |
---|
Methods in choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.globalCardConstraint with parameters of type RemovalsAdvisor | |
---|---|
boolean |
GlobalCardinalityNoLoop.applyGCC(RemovalsAdvisor rem)
Achieves generalized arc consistency in one call remove arcs connecting two different strongly connected components the event generated by the flow algorithm: discovering that an edge is no longer valid, and posting this event to the constraint solver: since we are already achieving GAC consistency in one single loop. |
void |
GlobalCardinalityNoLoop.deleteEdgeAndPublish(int i,
int j,
RemovalsAdvisor rem)
|
abstract void |
AbstractBipartGraph.deleteEdgeAndPublish(int i,
int j,
RemovalsAdvisor rem)
implement one of the two main events: when an edge is definitely removed from the bipartite assignment graph |
void |
AbstractBipartGraph.propagate(RemovalsAdvisor rem)
|
void |
AbstractBipartGraph.removeUselessEdges(RemovalsAdvisor rem)
remove arcs connecting two different strongly connected components the event generated by the flow algorithm: discovering that an edge is no longer valid, and posting this event to the constraint solver: since we are already achieving GAC consistency in one single loop, there is no need to post a constAwake |
Uses of RemovalsAdvisor in choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.timeWindows |
---|
Fields in choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.timeWindows declared as RemovalsAdvisor | |
---|---|
protected RemovalsAdvisor |
OrderedGraphPropag.propagateStruct
record the infeasible values in the different domains of the variables involved in the constraint |
protected RemovalsAdvisor |
DirectedPropag.propagateStruct
record the infeasible values in the different domains of the variables involved in the constraint |
Constructors in choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.timeWindows with parameters of type RemovalsAdvisor | |
---|---|
DirectedPropag(IStateInt[][] travelTime,
VarGraphView graph,
Node[] nodes,
RemovalsAdvisor propagateStruct)
Constructor: build a propagator for the time windows constraints according to the graph |
|
OrderedGraphPropag(IStateInt[][] travelTime,
IStateInt[][] minTravelTime,
PrecsGraphView precs,
Node[] nodes,
RemovalsAdvisor propagateStruct)
Constructor: build a propagator for the time windows constraints according to the precedence constraints |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |