| Interface | Description |
|---|---|
| GraphGenerator<T,A> | |
| IGraphSearch<I extends GraphSearchInput<N,A>,O,N,A> |
Graph search algorithms take a graph
|
| IGraphSearchFactory<I extends GraphSearchInput<N,A>,O,N,A> | |
| IOptimalPathInORGraphSearch<I extends GraphSearchInput<N,A>,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 GraphSearchInput<N,A>,N,A,V extends java.lang.Comparable<V>> | |
| IPathInORGraphSearch<I extends GraphSearchInput<N,A>,O extends SearchGraphPath<N,A>,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.
|
| Class | Description |
|---|---|
| AAnyPathInORGraphSearch<I extends GraphSearchInput<N,A>,O extends SearchGraphPath<N,A>,N,A> |
This is a template for algorithms that aim at finding paths from a root to
goal nodes in a graph.
|
| AOptimalPathInORGraphSearch<I extends GraphSearchInput<N,A>,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.
|
| EdgeCountingSolutionEvaluator<N,A> |
Uses Double to be compliant with algorithms that MUST work with double instead of Integer (such as AStar)
|
| StandardORGraphSearchFactory<I extends GraphSearchInput<N,A>,O,N,A,V extends java.lang.Comparable<V>> |