|
||||||||||
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.inputStructure.Node
public class Node
Field Summary | |
---|---|
protected IStateBitSet |
condSuccessors
the set of potential mandatory successors of the current node |
protected int |
idx
index of the current node |
protected IStateBitSet |
incomparableNodes
the set of incomparable nodes with the current node |
protected IntDomainVar |
inDegree
an integer variable that depicts the indegree of the current node |
protected IStateBitSet |
mandatorySuccessors
the set of mandatory successors of the current node |
protected IntDomainVar |
successors
an integer variable that depicts the potential sucessor nodes of the current node (by indices) |
protected IntDomainVar |
timeWindow
an integer variable that depicts the starting time from the current node |
Constructor Summary | |
---|---|
Node(Solver solver,
int nbNodes,
int idx,
IntDomainVar successor,
IntDomainVar inDegree,
IntDomainVar timeWindow,
List<BitSet[]> graphs)
constructor: build a node and its associated attributes |
|
Node(Solver solver,
int nbNodes,
int idx,
List<BitSet[]> graphs,
List<int[][]> matrix)
constructor: build a node and its associated attributes |
Method Summary | |
---|---|
IStateBitSet |
getCondSuccessors()
|
int |
getIdx()
|
IStateBitSet |
getIncomparableNodes()
|
IntDomainVar |
getInDegree()
|
IStateBitSet |
getMandatorySuccessors()
|
IntDomainVar |
getSuccessors()
|
IntDomainVar |
getTimeWindow()
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
protected int idx
protected IntDomainVar successors
protected IntDomainVar inDegree
protected IntDomainVar timeWindow
protected IStateBitSet mandatorySuccessors
protected IStateBitSet condSuccessors
protected IStateBitSet incomparableNodes
Constructor Detail |
---|
public Node(Solver solver, int nbNodes, int idx, IntDomainVar successor, IntDomainVar inDegree, IntDomainVar timeWindow, List<BitSet[]> graphs)
solver
- the Choco solver who uses the current tree constraintnbNodes
- the total number of nodes involved in the different graphsidx
- index of the current nodesuccessor
- the potential sucessor nodes of the current nodeinDegree
- the indegree of the current nodetimeWindow
- the starting time from the current nodegraphs
- a list of graphs: [0] the graph to partition, [1] the precedence graph,
[2] the conditional precedence graph and [3] the incomparability graph
ContradictionException
public Node(Solver solver, int nbNodes, int idx, List<BitSet[]> graphs, List<int[][]> matrix) throws ContradictionException
solver
- the Choco solver who uses the current tree constraintnbNodes
- the total number of nodes involved in the different graphsidx
- index of the current nodegraphs
- a list of graphs: [0] the graph to partition, [1] the precedence graph,
[2] the conditional precedence graph and [3] the incomparability graphmatrix
- a list of integer matrix: [0] the indegree of each node and [1] the starting time from each node
ContradictionException
Method Detail |
---|
public int getIdx()
public IntDomainVar getSuccessors()
public IntDomainVar getInDegree()
public IntDomainVar getTimeWindow()
public IStateBitSet getMandatorySuccessors()
public IStateBitSet getCondSuccessors()
public IStateBitSet getIncomparableNodes()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |