public class NAryTreeBasisILPTail extends AbstractNAryTreeLPTail implements nl.tue.astar.FastLowerBoundTail
Modifier and Type | Field and Description |
---|---|
protected int[] |
basis |
static int |
LPDerived |
static int |
LPSolved |
static int |
TailCreated |
estimate, PRECISION, variables
Constructor and Description |
---|
NAryTreeBasisILPTail(int estimate,
short[] variables,
boolean exact) |
NAryTreeBasisILPTail(NAryTreeBasisILPDelegate delegate,
NAryTreeHead head) |
NAryTreeBasisILPTail(NAryTreeBasisILPDelegate delegate,
NAryTreeHead h,
int minCost) |
Modifier and Type | Method and Description |
---|---|
void |
computeEstimate(nl.tue.astar.Delegate<? extends nl.tue.astar.Head,? extends nl.tue.astar.Tail> delegate,
nl.tue.astar.Head head,
int lastEstimate)
Starts the computation of the exact estimate on the first call.
|
int[] |
getBasis() |
protected static int[] |
getInitBasis(int l) |
NAryTreeBasisILPTail |
getNewTail(AbstractNAryTreeDelegate<?> delegate,
NAryTreeHead h,
int minCost) |
NAryTreeBasisILPTail |
getNewTail(int estimate,
short[] variables) |
nl.tue.astar.Tail |
getNextTail(nl.tue.astar.Delegate<? extends nl.tue.astar.Head,? extends nl.tue.astar.Tail> d,
nl.tue.astar.Head head,
int modelMove,
int logMove,
int activity)
constructs the new tail based on the two operations from the old head.
|
<S> nl.tue.astar.Tail |
getNextTailFromStorage(nl.tue.astar.Delegate<? extends nl.tue.astar.Head,? extends nl.tue.astar.Tail> d,
nl.tue.storage.CompressedStore<S> store,
long index,
int modelMove,
int logMove,
int activity)
constructs the new tail based on the two operations from the old state,
which is stored in the given store at the given index.
|
boolean |
isExactEstimateKnown()
This method should return true if the exact estimate is known.
|
void |
setBasis(int[] basis) |
canComplete, getEstimate, getEstimatedCosts, getVariables, toString, toString, updateVariables
public static int LPSolved
public static int TailCreated
public static int LPDerived
protected int[] basis
public NAryTreeBasisILPTail(NAryTreeBasisILPDelegate delegate, NAryTreeHead h, int minCost)
public NAryTreeBasisILPTail(int estimate, short[] variables, boolean exact)
public NAryTreeBasisILPTail(NAryTreeBasisILPDelegate delegate, NAryTreeHead head)
public <S> nl.tue.astar.Tail getNextTailFromStorage(nl.tue.astar.Delegate<? extends nl.tue.astar.Head,? extends nl.tue.astar.Tail> d, nl.tue.storage.CompressedStore<S> store, long index, int modelMove, int logMove, int activity) throws java.io.IOException
nl.tue.astar.Tail
getNextTailFromStorage
in interface nl.tue.astar.Tail
getNextTailFromStorage
in class AbstractNAryTreeLPTail
java.io.IOException
public NAryTreeBasisILPTail getNewTail(int estimate, short[] variables)
getNewTail
in class AbstractNAryTreeLPTail
public NAryTreeBasisILPTail getNewTail(AbstractNAryTreeDelegate<?> delegate, NAryTreeHead h, int minCost)
getNewTail
in class AbstractNAryTreeLPTail
public void computeEstimate(nl.tue.astar.Delegate<? extends nl.tue.astar.Head,? extends nl.tue.astar.Tail> delegate, nl.tue.astar.Head head, int lastEstimate)
nl.tue.astar.FastLowerBoundTail
computeEstimate
in interface nl.tue.astar.FastLowerBoundTail
public boolean isExactEstimateKnown()
nl.tue.astar.FastLowerBoundTail
isExactEstimateKnown
in interface nl.tue.astar.FastLowerBoundTail
public int[] getBasis()
public void setBasis(int[] basis)
protected static int[] getInitBasis(int l)
public nl.tue.astar.Tail getNextTail(nl.tue.astar.Delegate<? extends nl.tue.astar.Head,? extends nl.tue.astar.Tail> d, nl.tue.astar.Head head, int modelMove, int logMove, int activity)
nl.tue.astar.Tail
getNextTail
in interface nl.tue.astar.Tail
getNextTail
in class AbstractNAryTreeLPTail