| Class | Description |
|---|---|
| GraphSearchInput<N,A> |
This input is provided to algorithms that should find a solution path in a graph without path cost.
|
| GraphSearchWithNodeRecommenderInput<N,A> | |
| GraphSearchWithNumberBasedAdditivePathEvaluation<N,A> | |
| GraphSearchWithNumberBasedAdditivePathEvaluation.FComputer<N> | |
| GraphSearchWithNumberBasedAdditivePathEvaluationAndSubPathHeuristic<N,A> | |
| GraphSearchWithNumberBasedAdditivePathEvaluationAndSubPathHeuristic.SubPathEvaluationBasedFComputer<N> | |
| GraphSearchWithPathEvaluationsInput<N,A,V extends java.lang.Comparable<V>> |
In AILibs, a graph search problem always aims at identifying one or more paths from
a set of root nodes to a goal node.
|
| GraphSearchWithSubpathEvaluationsInput<N,A,V extends java.lang.Comparable<V>> |
Many algorithms such as best first and A* use a traversal tree to browse the underlying
graph.
|
| GraphSearchWithUncertaintyBasedSubpathEvaluationInput<N,A,V extends java.lang.Comparable<V>> |