public class StoredDirectedMultiGraph extends Object
Modifier and Type | Class and Description |
---|---|
class |
StoredDirectedMultiGraph.Arcs |
class |
StoredDirectedMultiGraph.Nodes |
Modifier and Type | Field and Description |
---|---|
StoredDirectedMultiGraph.Arcs |
GArcs |
StoredDirectedMultiGraph.Nodes |
GNodes |
BitSet |
inStack |
StoredIndexedBipartiteSetWithOffset[] |
layers |
int |
nbR |
int[] |
offsets |
int |
sourceIndex |
int |
tinIndex |
Constructor and Description |
---|
StoredDirectedMultiGraph(IEnvironment environment,
org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph,
int[][] layers,
int[] starts,
int[] offsets,
int supportLength,
ICostAutomaton pi,
IntVar[] z) |
Modifier and Type | Method and Description |
---|---|
void |
delayedBoundUpdate(gnu.trove.stack.TIntStack toRemove,
IntVar[] 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) |
FastPathFinder |
getPathFinder() |
int |
getRegret(int layer,
int value,
int... resources) |
StoredIndexedBipartiteSetWithOffset |
getUBport(int i,
int j) |
boolean |
isInStack(int idx)
Getter, the idx th bit of the inStack bitSet
|
void |
makePathFinder() |
boolean |
removeArc(int arcId,
gnu.trove.stack.TIntStack toRemove,
gnu.trove.stack.TIntStack[] updateLeft,
gnu.trove.stack.TIntStack[] updateRight,
Propagator<IntVar> propagator) |
void |
setInStack(int idx)
Set the idx th bit of the to be removed bitset
|
void |
updateLeft(gnu.trove.stack.TIntStack updateLeft,
gnu.trove.stack.TIntStack toRemove,
int dim,
boolean[] modBound,
Propagator<IntVar> propagator) |
void |
updateRight(gnu.trove.stack.TIntStack updateRight,
gnu.trove.stack.TIntStack toRemove,
int dim,
boolean[] modBound,
Propagator<IntVar> propagator) |
public int[] offsets
public int sourceIndex
public int tinIndex
public int nbR
public StoredIndexedBipartiteSetWithOffset[] layers
public BitSet inStack
public StoredDirectedMultiGraph.Nodes GNodes
public StoredDirectedMultiGraph.Arcs GArcs
public StoredDirectedMultiGraph(IEnvironment environment, org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph, int[][] layers, int[] starts, int[] offsets, int supportLength, ICostAutomaton pi, IntVar[] z)
public void delayedBoundUpdate(gnu.trove.stack.TIntStack toRemove, IntVar[] z, int... dim)
public final void makePathFinder()
public final StoredIndexedBipartiteSetWithOffset getUBport(int i, int j)
public final FastPathFinder getPathFinder()
public boolean removeArc(int arcId, gnu.trove.stack.TIntStack toRemove, gnu.trove.stack.TIntStack[] updateLeft, gnu.trove.stack.TIntStack[] updateRight, Propagator<IntVar> propagator) throws ContradictionException
ContradictionException
public void updateRight(gnu.trove.stack.TIntStack updateRight, gnu.trove.stack.TIntStack toRemove, int dim, boolean[] modBound, Propagator<IntVar> propagator) throws ContradictionException
ContradictionException
public void updateLeft(gnu.trove.stack.TIntStack updateLeft, gnu.trove.stack.TIntStack toRemove, int dim, boolean[] modBound, Propagator<IntVar> propagator) throws ContradictionException
ContradictionException
public final BitSet getInStack()
public final boolean isInStack(int idx)
idx
- the index of the arcpublic final void setInStack(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 double[] getInstantiatedLayerCosts(int layer)
public int getMinPathCost(int... resources)
Copyright © 2015. All rights reserved.