public class FastPathFinder extends Object
| Constructor and Description |
|---|
FastPathFinder(StoredDirectedMultiGraph graph) |
| Modifier and Type | Method and Description |
|---|---|
void |
computeLongestPath(gnu.trove.stack.TIntStack removed,
double lb,
double[] u,
boolean lagrange,
boolean max,
int resource,
PropMultiCostRegular propagator) |
void |
computeShortestAndLongestPath(IStateIntVector removed,
int lb,
int ub,
double[] u,
boolean lagrange,
boolean max,
int resource,
PropMultiCostRegular propagator) |
boolean[] |
computeShortestAndLongestPath(gnu.trove.stack.TIntStack removed,
IntVar[] z,
PropMultiCostRegular propagator) |
void |
computeShortestPath(gnu.trove.stack.TIntStack removed,
double ub,
double[] u,
boolean lagrange,
boolean max,
int resource,
PropMultiCostRegular propagator) |
int[] |
getLongestPath() |
double |
getLongestPathValue() |
int[] |
getShortestPath() |
double |
getShortestPathValue() |
public FastPathFinder(StoredDirectedMultiGraph graph)
public void computeLongestPath(gnu.trove.stack.TIntStack removed,
double lb,
double[] u,
boolean lagrange,
boolean max,
int resource,
PropMultiCostRegular propagator)
throws ContradictionException
ContradictionExceptionpublic final double getLongestPathValue()
public int[] getLongestPath()
public void computeShortestPath(gnu.trove.stack.TIntStack removed,
double ub,
double[] u,
boolean lagrange,
boolean max,
int resource,
PropMultiCostRegular propagator)
throws ContradictionException
ContradictionExceptionpublic final double getShortestPathValue()
public int[] getShortestPath()
public void computeShortestAndLongestPath(IStateIntVector removed, int lb, int ub, double[] u, boolean lagrange, boolean max, int resource, PropMultiCostRegular propagator) throws ContradictionException
ContradictionExceptionpublic boolean[] computeShortestAndLongestPath(gnu.trove.stack.TIntStack removed,
IntVar[] z,
PropMultiCostRegular propagator)
throws ContradictionException
ContradictionExceptionCopyright © 2017. All rights reserved.