|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectchoco.search.AbstractSearchHeuristic
choco.integer.search.AbstractIntVarSelector
choco.integer.search.MostConstrained
public class MostConstrained
An heuristic to first instantiating most constrained variables.
Field Summary |
---|
Fields inherited from class choco.integer.search.AbstractIntVarSelector |
---|
vars |
Fields inherited from class choco.search.AbstractSearchHeuristic |
---|
branching, problem |
Constructor Summary | |
---|---|
MostConstrained(Problem pb)
Builds the heuristic for the given problem. |
|
MostConstrained(Problem pb,
IntDomainVar[] vs)
Builds the heuristic for the given problem. |
Method Summary | |
---|---|
IntDomainVar |
selectIntVar()
Searches for a non instantiated variable with as much constraints posted on it as possible. |
Methods inherited from class choco.integer.search.AbstractIntVarSelector |
---|
selectVar |
Methods inherited from class choco.search.AbstractSearchHeuristic |
---|
getBranching |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface choco.search.IVarSelector |
---|
getBranching |
Constructor Detail |
---|
public MostConstrained(Problem pb)
pb
- the solved problempublic MostConstrained(Problem pb, IntDomainVar[] vs)
pb
- the solved problemvs
- a list of variables instead of all prolem integer variablesMethod Detail |
---|
public IntDomainVar selectIntVar()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |