|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectchoco.kernel.solver.constraints.global.automata.fast_multicostregular.structure.SoftStoredMultiValuedDirectedMultiGraph
public class SoftStoredMultiValuedDirectedMultiGraph
Created by IntelliJ IDEA. User: julien Date: Apr 28, 2010 Time: 3:17:28 PM
Nested Class Summary | |
---|---|
class |
SoftStoredMultiValuedDirectedMultiGraph.Arcs
|
class |
SoftStoredMultiValuedDirectedMultiGraph.Nodes
|
Constructor Summary | |
---|---|
SoftStoredMultiValuedDirectedMultiGraph(IEnvironment environment,
AbstractIntSConstraint constraint,
org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph,
int[][] layers,
int[] starts,
int[] offsets,
int supportLength,
int[][][][] costs,
IntDomainVar[] y)
|
Method Summary | |
---|---|
void |
clearInStack(int idx)
Clear the idx th bit of the to be removed bitset |
void |
delayedBoundUpdate(gnu.trove.TIntStack toRemove,
IntDomainVar[] z,
int... dim)
|
BitSet |
getInStack()
Getter to the is arc in to be removed stack bitSet |
double[] |
getInstantiatedLayerCosts(int layer)
|
int[] |
getMinMaxPathCostForAssignment(int layer,
int value,
int... resources)
|
int |
getMinPathCost(int... resources)
|
int |
getMinPathCostForAssignment(int layer,
int value,
int... resources)
|
int |
getRegret(int layer,
int value,
int... resources)
|
StoredIndexedBipartiteSetWithOffset |
getSupport(int i,
int j)
|
boolean |
isInStack(int idx)
Getter, the idx th bit of the inStack bitSet |
boolean |
removeArc(int arcId,
gnu.trove.TIntStack toRemove,
gnu.trove.TIntStack[] updateLeft,
gnu.trove.TIntStack[] updateRight)
|
void |
setInStack(int idx)
Set the idx th bit of the to be removed bitset |
boolean |
updateLeft(gnu.trove.TIntStack updateLeft,
gnu.trove.TIntStack toRemove,
int dim,
AbstractIntSConstraint table)
|
boolean |
updateRight(gnu.trove.TIntStack updateRight,
gnu.trove.TIntStack toRemove,
int dim,
AbstractIntSConstraint table)
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public AbstractIntSConstraint constraint
public int[] offsets
public int sourceIndex
public int tinIndex
public int nbR
public StoredIndexedBipartiteSetWithOffset[] layers
public SoftPathFinder pf
public BitSet inStack
public SoftStoredMultiValuedDirectedMultiGraph.Nodes GNodes
public SoftStoredMultiValuedDirectedMultiGraph.Arcs GArcs
Constructor Detail |
---|
public SoftStoredMultiValuedDirectedMultiGraph(IEnvironment environment, AbstractIntSConstraint constraint, org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph, int[][] layers, int[] starts, int[] offsets, int supportLength, int[][][][] costs, IntDomainVar[] y)
Method Detail |
---|
public final StoredIndexedBipartiteSetWithOffset getSupport(int i, int j)
public void delayedBoundUpdate(gnu.trove.TIntStack toRemove, IntDomainVar[] z, int... dim)
public boolean removeArc(int arcId, gnu.trove.TIntStack toRemove, gnu.trove.TIntStack[] updateLeft, gnu.trove.TIntStack[] updateRight) throws ContradictionException
ContradictionException
public boolean updateRight(gnu.trove.TIntStack updateRight, gnu.trove.TIntStack toRemove, int dim, AbstractIntSConstraint table) throws ContradictionException
ContradictionException
public boolean updateLeft(gnu.trove.TIntStack updateLeft, gnu.trove.TIntStack toRemove, int dim, AbstractIntSConstraint table) throws ContradictionException
ContradictionException
public final BitSet getInStack()
public final boolean isInStack(int idx)
idx
- the index of the arc
public final void setInStack(int idx)
idx
- the index of the bitpublic final void clearInStack(int idx)
idx
- the index of the bitpublic int getRegret(int layer, int value, int... resources)
public int getMinPathCostForAssignment(int layer, int value, int... resources)
public int[] getMinMaxPathCostForAssignment(int layer, int value, int... resources)
public int getMinPathCost(int... resources)
public double[] getInstantiatedLayerCosts(int layer)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |