Index (ai.graphsearch 0.0.1 API)

A C E G I N O P R S
All Classes All Packages

A

annotatesUncertainty() - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPotentiallyUncertaintyAnnotatingPathEvaluator

C

calculateUncertainty(IEvaluatedPath<T, A, V>, List<IPath<T, A>>, List<V>) - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IUncertaintySource
cancelActiveTasks() - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.ICancelableNodeEvaluator

E

evaluate(IPath<N, A>) - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator

G

getGoalTester() - Method in interface org.api4.java.ai.graphsearch.problem.IGraphSearchInput
getGraphGenerator() - Method in interface org.api4.java.ai.graphsearch.problem.IGraphSearch
getGraphGenerator() - Method in interface org.api4.java.ai.graphsearch.problem.IGraphSearchInput
getPathEvaluator() - Method in interface org.api4.java.ai.graphsearch.problem.IGraphSearchWithPathEvaluationsInput

I

ICancelableNodeEvaluator - Interface in org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation
IEvaluatedPath<N,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation
IGraphSearch,O,N,A> - Interface in org.api4.java.ai.graphsearch.problem: Graph search algorithms take a graph that is given in the form of a graph generator and search it.
IGraphSearchFactory,O,N,A,A2 extends IGraphSearch<I,O,N,A>> - Interface in org.api4.java.ai.graphsearch.problem
IGraphSearchInput<N,A> - Interface in org.api4.java.ai.graphsearch.problem
IGraphSearchWithPathEvaluationsInput<N,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem
IOptimalPathInORGraphSearch,O extends IEvaluatedPath<N,A,V>,N,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem: This is a template for algorithms that aim at finding paths from a root to goal nodes in a graph.
IOptimalPathInORGraphSearchFactory,O extends IEvaluatedPath<N,A,V>,N,A,V extends java.lang.Comparable<V>,A2 extends IOptimalPathInORGraphSearch<I,O,N,A,V>> - Interface in org.api4.java.ai.graphsearch.problem
IPathEvaluator<N,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation
IPathInORGraphSearch,O extends org.api4.java.datastructure.graph.IPath<N,A>,N,A> - Interface in org.api4.java.ai.graphsearch.problem
IPotentiallyGraphDependentPathEvaluator<T,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation
IPotentiallySolutionReportingPathEvaluator<T,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation: This interface suggests that the node evaluator MAY report solutions that he finds under a node.
IPotentiallyUncertaintyAnnotatingPathEvaluator<N,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation
isGoal(N) - Method in interface org.api4.java.ai.graphsearch.problem.implicit.graphgenerator.NodeGoalTester: Check if the current node is a goal for the problem.
isGoal(IPath<N, A>) - Method in interface org.api4.java.ai.graphsearch.problem.implicit.graphgenerator.NodeGoalTester
isGoal(IPath<N, A>) - Method in interface org.api4.java.ai.graphsearch.problem.implicit.graphgenerator.PathGoalTester: Check if the current node is a goal for the problem.
isPathSemanticallySubsumed(List<N>, List<N>) - Method in interface org.api4.java.ai.graphsearch.problem.PathUnifyingGraphGenerator
IUncertaintySource<T,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation

N

NodeGoalTester<N,A> - Interface in org.api4.java.ai.graphsearch.problem.implicit.graphgenerator

O

org.api4.java.ai.graphsearch.problem - package org.api4.java.ai.graphsearch.problem
org.api4.java.ai.graphsearch.problem.implicit.graphgenerator - package org.api4.java.ai.graphsearch.problem.implicit.graphgenerator
org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation - package org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation

P

PathEvaluationException - Exception in org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation
PathEvaluationException(String) - Constructor for exception org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.PathEvaluationException
PathEvaluationException(String, Throwable) - Constructor for exception org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.PathEvaluationException
PathGoalTester<N,A> - Interface in org.api4.java.ai.graphsearch.problem.implicit.graphgenerator
PathUnifyingGraphGenerator<N,A> - Interface in org.api4.java.ai.graphsearch.problem: This is an extension of the classical GraphGenerator that allows to assert that a path is semantically subsumed by another.

R

registerSolutionListener(Object) - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPotentiallySolutionReportingPathEvaluator
reportsSolutions() - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPotentiallySolutionReportingPathEvaluator
requiresGraphGenerator() - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPotentiallyGraphDependentPathEvaluator

S

SerializableNodeEvaluator<T,A,V extends java.lang.Comparable<V>> - Interface in org.api4.java.ai.graphsearch.problem.implicit.graphgenerator
setGenerator(IGraphGenerator<T, A>, PathGoalTester<T, A>) - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPotentiallyGraphDependentPathEvaluator
setUncertaintySource(IUncertaintySource<N, A, V>) - Method in interface org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPotentiallyUncertaintyAnnotatingPathEvaluator

A C E G I N O P R S
All Classes All Packages