choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.tree
Class Tree
java.lang.Object
choco.cp.solver.constraints.global.tree.filtering.AbstractPropagator
choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.tree.Tree
public class Tree
- extends AbstractPropagator
Fields inherited from class choco.cp.solver.constraints.global.tree.filtering.AbstractPropagator |
affiche, condPrecs, costStruct, doms, incomp, indices, inputGraph, LOGGER, nbVertices, nodes, precs, propagateStruct, solver, struct, tree |
Method Summary |
boolean |
feasibility()
Necessary and sufficient condition for the pure tree constraint. |
void |
filter()
Filtering method for the pure tree constraint. |
String |
getTypePropag()
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Tree
public Tree(Object[] params)
getTypePropag
public String getTypePropag()
- Specified by:
getTypePropag
in class AbstractPropagator
feasibility
public boolean feasibility()
- Necessary and sufficient condition for the pure tree constraint. The checkout is made with
the reduced graph associated with the graph to partition:
1- intersection{dom(ntree),[MINTREE,MAXTREE]} != emptySet;
2- the sinks of the ReducedGraph involve at least one node the graph which is a
potential root.
- Specified by:
feasibility
in class AbstractPropagator
- Returns:
false
iff the propagator detect an inconsistency
filter
public void filter()
throws ContradictionException
- Filtering method for the pure tree constraint. Algorithmics details are provided in the CPAIOR'05 paper.
- Specified by:
filter
in class AbstractPropagator
- Throws:
ContradictionException
Copyright © 2012. All Rights Reserved.