choco.cp.solver.constraints.global.tree.filtering.structuralFiltering
Class Incomparability

java.lang.Object
  extended by choco.cp.solver.constraints.global.tree.filtering.AbstractPropagator
      extended by choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.Incomparability

public class Incomparability
extends AbstractPropagator


Field Summary
 
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
 
Constructor Summary
Incomparability(Object[] params)
           
 
Method Summary
 boolean feasibility()
          check the consistency of the filtering rules of a given propagator
 void filter()
           two filtering rules are applied for the incomparability constraints: 1- remove infeasible potential roots when the number of trees is fixed to 1.
 String getTypePropag()
           
 
Methods inherited from class choco.cp.solver.constraints.global.tree.filtering.AbstractPropagator
applyConstraint
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

Incomparability

public Incomparability(Object[] params)
Method Detail

getTypePropag

public String getTypePropag()
Specified by:
getTypePropag in class AbstractPropagator

feasibility

public boolean feasibility()
Description copied from class: AbstractPropagator
check the consistency of the filtering rules of a given propagator

Specified by:
feasibility in class AbstractPropagator
Returns:
false iff the propagator detect an inconsistency

filter

public void filter()
            throws ContradictionException

two filtering rules are applied for the incomparability constraints:

1- remove infeasible potential roots when the number of trees is fixed to 1.
2- for each potential arc (u,v) in the graph, if there exists a node u_d in the mandatory descendants of u and a node a_v in the mandatory ancestors of v such that u_d and a_v are incomparable then, the arc (u,v) is infeasible according to the interaction between precedence and incomparability constraints.

Specified by:
filter in class AbstractPropagator
Throws:
ContradictionException


Copyright © 2012. All Rights Reserved.