All Classes Interface Summary Exception Summary
| Class |
Description |
| ICancelableNodeEvaluator |
|
| IEvaluatedPath<N,A,V extends java.lang.Comparable<V>> |
|
| IGraphSearch<I extends IGraphSearchInput<N,A>,O,N,A> |
Graph search algorithms take a graph that is given in the form of a graph generator and search it.
|
| IGraphSearchFactory<I extends IGraphSearchInput<N,A>,O,N,A,A2 extends IGraphSearch<I,O,N,A>> |
|
| IGraphSearchInput<N,A> |
|
| IGraphSearchWithPathEvaluationsInput<N,A,V extends java.lang.Comparable<V>> |
|
| IOptimalPathInORGraphSearch<I extends IGraphSearchInput<N,A>,O extends IEvaluatedPath<N,A,V>,N,A,V extends java.lang.Comparable<V>> |
This is a template for algorithms that aim at finding paths from a root to
goal nodes in a graph.
|
| IOptimalPathInORGraphSearchFactory<I extends IGraphSearchInput<N,A>,O extends IEvaluatedPath<N,A,V>,N,A,V extends java.lang.Comparable<V>,A2 extends IOptimalPathInORGraphSearch<I,O,N,A,V>> |
|
| IPathEvaluator<N,A,V extends java.lang.Comparable<V>> |
|
| IPathInORGraphSearch<I extends IGraphSearchInput<N,A>,O extends org.api4.java.datastructure.graph.IPath<N,A>,N,A> |
|
| IPotentiallyGraphDependentPathEvaluator<T,A,V extends java.lang.Comparable<V>> |
|
| IPotentiallySolutionReportingPathEvaluator<T,A,V extends java.lang.Comparable<V>> |
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>> |
|
| IUncertaintySource<T,A,V extends java.lang.Comparable<V>> |
|
| NodeGoalTester<N,A> |
|
| PathEvaluationException |
|
| PathGoalTester<N,A> |
|
| PathUnifyingGraphGenerator<N,A> |
This is an extension of the classical GraphGenerator that allows to assert that a path is semantically subsumed by another.
|
| SerializableNodeEvaluator<T,A,V extends java.lang.Comparable<V>> |
|