Package org.api4.java.ai.graphsearch.problem

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

Type Parameters:

I -

O -

N -

A -

All Superinterfaces:

java.util.concurrent.Callable<O>, org.api4.java.common.control.Cancelable, org.api4.java.algorithm.IAlgorithm<I,O>, java.lang.Iterable<org.api4.java.algorithm.events.AlgorithmEvent>, java.util.Iterator<org.api4.java.algorithm.events.AlgorithmEvent>

All Known Subinterfaces:

IOptimalPathInORGraphSearch<I,O,N,A,V>, IPathInORGraphSearch<I,O,N,A>

public interface IGraphSearch<I extends IGraphSearchInput<N,A>,O,N,A>
extends org.api4.java.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	Description
org.api4.java.datastructure.graph.implicit.IGraphGenerator<N,A>	getGraphGenerator()

Methods inherited from interface org.api4.java.common.control.Cancelable

cancel

Methods inherited from interface org.api4.java.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

Method Detail

getGraphGenerator

org.api4.java.datastructure.graph.implicit.IGraphGenerator<N,A> getGraphGenerator()