|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectchoco.cp.solver.constraints.global.tree.structure.internalStructure.graphStructures.graphViews.VarGraphView
public class VarGraphView
Field Summary | |
---|---|
protected boolean |
affiche
boolean for debug and show a trace of the execution |
protected StoredBitSetGraph |
global
data structure of the graph to partition |
protected IStateBitSet[] |
globalGraph
backtrackable bitset matrix representing the graph to partition |
protected List<StoredBitSetGraph.Maintain> |
globalParams
list of graph properties to maintain for the graph to partition |
protected static Logger |
LOGGER
|
protected StoredBitSetGraph |
maybe
data structure of the potential graph associated with global |
protected IStateBitSet[] |
maybeGraph
backtrackable bitset matrix representing the potential graph |
protected List<StoredBitSetGraph.Maintain> |
maybeParams
list of graph properties to maintain for the potential graph to partition |
protected int |
nbNodes
total number of nodes involved in the graph |
protected IStateBitSet |
potentialRoots
backtrackable bitset that store the potential roots involved in global |
protected ReducedGraph |
reducedGraph
reduced graph structure associated with global |
protected IntDomainVar[] |
s
the successor variables depicting the graph to partition |
protected Solver |
solver
Choco solver embedding the tree constraint |
protected StoredBitSetGraph |
sure
data structure of the required graph associated with global |
protected IStateBitSet[] |
sureGraph
backtrackable bitset matrix representing the required graph |
protected List<StoredBitSetGraph.Maintain> |
sureParams
list of graph properties to maintain for the required graph to partition |
Constructor Summary | |
---|---|
VarGraphView(Solver solver,
IntDomainVar[] vars)
Constructor of the graph view |
Method Summary | |
---|---|
int |
getFixedSucc(int u)
|
StoredBitSetGraph |
getGlobal()
|
StoredBitSetGraph |
getMaybe()
|
int |
getNbNodes()
|
IStateBitSet |
getPotentialRoots()
|
ReducedGraph |
getReducedGraph()
|
Solver |
getSolver()
|
StoredBitSetGraph |
getSure()
|
boolean |
isFixedSucc(int u)
|
void |
showGlobal()
|
void |
showMaybe()
|
void |
showSure()
|
void |
updateOnBounds(int u)
remove all the successors of u with an index below to s[u].getInf() and
higher than s[u].getSup() |
void |
updateOnInf(int u)
remove all the successors of u with an index below to s[u].getInf() |
void |
updateOnInst(int u)
an arc (u,v) is fixed |
void |
updateOnRem(int u,
int v)
an arc (u,v) is removed from the graph |
void |
updateOnRemovals(int u,
DisposableIntIterator deltaDomain)
all the arc (u,v), such that v belongs to the set depicted by the iterator, are removed |
void |
updateOnSup(int u)
remove all the successors of u with an index higher than s[u].getSup() |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
protected static final Logger LOGGER
protected boolean affiche
protected Solver solver
protected IntDomainVar[] s
protected List<StoredBitSetGraph.Maintain> globalParams
protected List<StoredBitSetGraph.Maintain> sureParams
protected List<StoredBitSetGraph.Maintain> maybeParams
protected int nbNodes
protected StoredBitSetGraph global
protected StoredBitSetGraph sure
protected StoredBitSetGraph maybe
protected IStateBitSet[] globalGraph
protected IStateBitSet[] sureGraph
protected IStateBitSet[] maybeGraph
protected ReducedGraph reducedGraph
protected IStateBitSet potentialRoots
Constructor Detail |
---|
public VarGraphView(Solver solver, IntDomainVar[] vars)
solver
- the Choco solver who uses the current tree constraintvars
- the successor variables depicting the graph to partitionMethod Detail |
---|
public void updateOnRem(int u, int v)
u
- index of a nodev
- index of a nodepublic void updateOnInst(int u)
u
- index of a nodepublic void updateOnRemovals(int u, DisposableIntIterator deltaDomain)
u
- index of a nodedeltaDomain
- an iterator over the removed indicespublic void updateOnInf(int u)
s[u].getInf()
u
- index of a nodepublic void updateOnSup(int u)
s[u].getSup()
u
- index of a nodepublic void updateOnBounds(int u)
s[u].getInf()
and
higher than s[u].getSup()
u
- index of a nodepublic boolean isFixedSucc(int u)
u
- index of a node
true iff an outgoing arc from node u is fixed
public int getFixedSucc(int u)
u
- index of a node
public int getNbNodes()
public Solver getSolver()
public StoredBitSetGraph getGlobal()
public StoredBitSetGraph getSure()
public StoredBitSetGraph getMaybe()
public IStateBitSet getPotentialRoots()
public ReducedGraph getReducedGraph()
public void showSure()
public void showMaybe()
public void showGlobal()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |