- Type Parameters:
I -
O -
N -
A -
- All Superinterfaces:
- java.util.concurrent.Callable<O>, ai.libs.jaicore.basic.Cancelable, ai.libs.jaicore.basic.algorithm.IAlgorithm<I,O>, java.lang.Iterable<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>, java.util.Iterator<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>
- All Known Subinterfaces:
- IOptimalPathInORGraphSearch<I,N,A,V>, IPathInORGraphSearch<I,O,N,A>
- All Known Implementing Classes:
- AAnyPathInORGraphSearch, AndORBottomUpFilter, AOptimalPathInORGraphSearch, AStar, AwaStarSearch, BestFirst, BestFirstEpsilon, BestFirstLimitedDiscrepancySearch, DepthFirstSearch, GraphSanityChecker, IteratingGraphSearchOptimizer, LimitedDiscrepancySearch, MCTS, RandomizedDepthFirstSearch, RandomSearch, RStar, StandardBestFirst, UCT
public interface IGraphSearch<I extends GraphSearchInput<N,A>,O,N,A>
extends ai.libs.jaicore.basic.algorithm.IAlgorithm<I,O>
Graph search algorithms take a graph that is given in the form of a graph generator and search it.
Usually, the algorithm uses internal wrapper classes to represent edges and nodes, which is why there are
additional generics for that.