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

Interface IOptimalPathInORGraphSearch<I extends IGraphSearchInput<N,​A>,​O extends IEvaluatedPath<N,​A,​V>,​N,​A,​V extends java.lang.Comparable<V>>

  • Type Parameters:
    I -
    N -
    A -
    V -
    NSearch -
    Asearch -
    All Superinterfaces:
    java.util.concurrent.Callable<O>, org.api4.java.common.control.Cancelable, org.api4.java.algorithm.IAlgorithm<I,​O>, IGraphSearch<I,​O,​N,​A>, org.api4.java.algorithm.IOptimizationAlgorithm<I,​O,​V>, IPathInORGraphSearch<I,​O,​N,​A>, org.api4.java.algorithm.ISolutionCandidateIterator<I,​O>, java.lang.Iterable<org.api4.java.algorithm.events.AlgorithmEvent>, java.util.Iterator<org.api4.java.algorithm.events.AlgorithmEvent>
    public interface IOptimalPathInORGraphSearch<I extends IGraphSearchInput<N,​A>,​O extends IEvaluatedPath<N,​A,​V>,​N,​A,​V extends java.lang.Comparable<V>>
extends org.api4.java.algorithm.IOptimizationAlgorithm<I,​O,​V>, IPathInORGraphSearch<I,​O,​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

    • Method Summary

      • 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 org.api4.java.algorithm.ISolutionCandidateIterator

        nextSolutionCandidate, nextSolutionCandidateEvent

      • Methods inherited from interface java.lang.Iterable

        forEach, iterator, spliterator

      • Methods inherited from interface java.util.Iterator

        forEachRemaining, hasNext, next, remove