|
||||||||||
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.PrecsGraphView
public class PrecsGraphView
Field Summary | |
---|---|
protected boolean |
affiche
boolean for debug and show a trace of the execution |
protected static Logger |
LOGGER
|
protected int |
nbNodes
total number of nodes involved in the graph |
protected StoredBitSetGraph |
precs
data structure of the precedence graph |
protected IStateBitSet[] |
precsGraph
backtrackable bitset matrix representing the precedence graph |
protected List<StoredBitSetGraph.Maintain> |
precsParams
list of graph properties to maintain for the precedence graph |
protected Solver |
solver
Choco solver embedding the tree constraint |
Constructor Summary | |
---|---|
PrecsGraphView(Solver solver,
Node[] nodes)
|
Method Summary | |
---|---|
boolean |
addPrec(int u,
int v)
incrementaly add the arc (u,v) in the precedence graph |
BitSet |
getAncestors(int i)
|
BitSet |
getDescendants(int i)
|
IStateBitSet[] |
getNumFromVertCC()
|
StoredBitSetGraph |
getPrecs()
|
IStateBitSet |
getPredecessors(int i)
|
IStateBitSet |
getSinkNodes()
|
IStateBitSet |
getSrcNodes()
|
IStateBitSet |
getSuccessors(int i)
|
IStateBitSet[] |
getVertFromNumCC()
|
void |
showAllDesc()
|
String |
showDesc(int i)
|
void |
showPrecGraph()
|
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 List<StoredBitSetGraph.Maintain> precsParams
protected int nbNodes
protected StoredBitSetGraph precs
protected IStateBitSet[] precsGraph
Constructor Detail |
---|
public PrecsGraphView(Solver solver, Node[] nodes)
solver
- the Choco solver who uses the current tree constraintnodes
- total number of nodes involved in the graphMethod Detail |
---|
public boolean addPrec(int u, int v)
u
- index of a nodev
- index of a node
true
iff the arc (u,v) is effectively added in the precedence graphpublic StoredBitSetGraph getPrecs()
public IStateBitSet getSuccessors(int i)
public IStateBitSet getPredecessors(int i)
public BitSet getDescendants(int i)
public BitSet getAncestors(int i)
public IStateBitSet getSinkNodes()
public IStateBitSet getSrcNodes()
public IStateBitSet[] getVertFromNumCC()
public IStateBitSet[] getNumFromVertCC()
public String showDesc(int i)
public void showPrecGraph()
public void showAllDesc()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |