public class LimitedDiscrepancySearch<T,A,V extends java.lang.Comparable<V>> extends AOptimalPathInORGraphSearch<GraphSearchWithNodeRecommenderInput<T,A>,T,A,V>
| Modifier and Type | Field and Description |
|---|---|
protected boolean |
checkGoalPropertyOnEntirePath |
protected java.util.Collection<ai.libs.jaicore.graph.TreeNode<T>> |
exhausted |
protected java.util.Collection<ai.libs.jaicore.graph.TreeNode<T>> |
expanded |
protected java.util.Comparator<T> |
heuristic |
protected NodeGoalTester<T> |
nodeGoalTester |
protected PathGoalTester<T> |
pathGoalTester |
protected SingleRootGenerator<T> |
rootGenerator |
protected SuccessorGenerator<T,A> |
successorGenerator |
protected ai.libs.jaicore.graph.TreeNode<T> |
traversalTree |
| Constructor and Description |
|---|
LimitedDiscrepancySearch(GraphSearchWithNodeRecommenderInput<T,A> problemInput) |
| Modifier and Type | Method and Description |
|---|---|
java.lang.String |
getLoggerName() |
protected ai.libs.jaicore.graph.TreeNode<T> |
newNode(ai.libs.jaicore.graph.TreeNode<T> parent,
T newNode) |
ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent |
nextWithException() |
void |
setLoggerName(java.lang.String name) |
getGraphGenerator, nextSolutionCandidateEvent, registerSolutioncall, getBestSeenSolution, nextSolutionCandidate, setBestSeenSolution, updateBestSeenSolutioncollectAllSolutionsactivate, announceTimeoutDetected, avoidReinterruptionOnShutdownOnCurrentThread, cancel, checkAndConductTermination, checkTermination, computeTimeoutAware, getActivationTime, getConfig, getId, getInput, getNumCPUs, getRemainingTimeToDeadline, getState, getTimeout, getTimeoutPrecautionOffset, hasNext, hasThreadBeenInterruptedDuringShutdown, interruptThreadAsPartOfShutdown, isCanceled, isShutdownInitialized, isStopCriterionSatisfied, isTimeouted, iterator, next, post, registerActiveThread, registerListener, resolveShutdownInterruptOnCurrentThread, setConfig, setMaxNumThreads, setNumCPUs, setState, setTimeout, setTimeout, setTimeoutPrecautionOffset, shutdown, terminate, unregisterActiveThread, unregisterThreadAndShutdownclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitnextSolutionCandidateprotected ai.libs.jaicore.graph.TreeNode<T> traversalTree
protected java.util.Collection<ai.libs.jaicore.graph.TreeNode<T>> expanded
protected java.util.Collection<ai.libs.jaicore.graph.TreeNode<T>> exhausted
protected final SingleRootGenerator<T> rootGenerator
protected final SuccessorGenerator<T,A> successorGenerator
protected final boolean checkGoalPropertyOnEntirePath
protected final PathGoalTester<T> pathGoalTester
protected final NodeGoalTester<T> nodeGoalTester
protected final java.util.Comparator<T> heuristic
public LimitedDiscrepancySearch(GraphSearchWithNodeRecommenderInput<T,A> problemInput)
public ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent nextWithException()
throws java.lang.InterruptedException,
ai.libs.jaicore.basic.algorithm.exceptions.AlgorithmTimeoutedException,
ai.libs.jaicore.basic.algorithm.AlgorithmExecutionCanceledException,
ai.libs.jaicore.basic.algorithm.exceptions.AlgorithmException
java.lang.InterruptedExceptionai.libs.jaicore.basic.algorithm.exceptions.AlgorithmTimeoutedExceptionai.libs.jaicore.basic.algorithm.AlgorithmExecutionCanceledExceptionai.libs.jaicore.basic.algorithm.exceptions.AlgorithmExceptionprotected ai.libs.jaicore.graph.TreeNode<T> newNode(ai.libs.jaicore.graph.TreeNode<T> parent, T newNode)
public java.lang.String getLoggerName()
getLoggerName in interface ai.libs.jaicore.basic.ILoggingCustomizablegetLoggerName in class AOptimalPathInORGraphSearch<GraphSearchWithNodeRecommenderInput<T,A>,T,A,V extends java.lang.Comparable<V>>public void setLoggerName(java.lang.String name)
setLoggerName in interface ai.libs.jaicore.basic.ILoggingCustomizablesetLoggerName in class AOptimalPathInORGraphSearch<GraphSearchWithNodeRecommenderInput<T,A>,T,A,V extends java.lang.Comparable<V>>