- Type Parameters:
I -
N -
A -
V -
NSearch -
Asearch -
- All Superinterfaces:
- java.util.concurrent.Callable<EvaluatedSearchGraphPath<N,A,V>>, ai.libs.jaicore.basic.Cancelable, ai.libs.jaicore.basic.algorithm.IAlgorithm<I,EvaluatedSearchGraphPath<N,A,V>>, IGraphSearch<I,EvaluatedSearchGraphPath<N,A,V>,N,A>, ai.libs.jaicore.basic.algorithm.IOptimizationAlgorithm<I,EvaluatedSearchGraphPath<N,A,V>,V>, IPathInORGraphSearch<I,EvaluatedSearchGraphPath<N,A,V>,N,A>, ai.libs.jaicore.basic.algorithm.ISolutionCandidateIterator<I,EvaluatedSearchGraphPath<N,A,V>>, java.lang.Iterable<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>, java.util.Iterator<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>
- All Known Implementing Classes:
- AOptimalPathInORGraphSearch, AStar, AwaStarSearch, BestFirst, BestFirstEpsilon, BestFirstLimitedDiscrepancySearch, GraphSanityChecker, IteratingGraphSearchOptimizer, LimitedDiscrepancySearch, MCTS, RandomizedDepthFirstSearch, RStar, StandardBestFirst, UCT
public interface IOptimalPathInORGraphSearch<I extends GraphSearchInput<N,A>,N,A,V extends java.lang.Comparable<V>>
extends ai.libs.jaicore.basic.algorithm.IOptimizationAlgorithm<I,EvaluatedSearchGraphPath<N,A,V>,V>, IGraphSearch<I,EvaluatedSearchGraphPath<N,A,V>,N,A>, IPathInORGraphSearch<I,EvaluatedSearchGraphPath<N,A,V>,N,A>
This is a template for algorithms that aim at finding paths from a root to
goal nodes in a graph. This template does not assume paths to have a score.
The output type of this algorithm is fixed to EvaluatedSearchGraphPath