ai.libs.jaicore.search.core.interfaces

Interface IGraphSearch<I extends GraphSearchInput<N,A>,O,N,A>

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.

Method Summary

Modifier and Type	Method and Description
GraphGenerator<N,A>	getGraphGenerator()

Methods inherited from interface ai.libs.jaicore.basic.algorithm.IAlgorithm

call, getConfig, getId, getInput, getNumCPUs, getTimeout, nextWithException, registerListener, setMaxNumThreads, setNumCPUs, setTimeout, setTimeout

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Methods inherited from interface java.util.Iterator

forEachRemaining, hasNext, next, remove

Methods inherited from interface ai.libs.jaicore.basic.Cancelable

cancel

Method Detail

getGraphGenerator

GraphGenerator<N,A> getGraphGenerator()