- Type Parameters:
N - A - V -
- Direct Known Subclasses:
- GraphSearchWithNumberBasedAdditivePathEvaluation, GraphSearchWithUncertaintyBasedSubpathEvaluationInput
public class GraphSearchWithSubpathEvaluationsInput<N,A,V extends java.lang.Comparable<V>>
extends GraphSearchWithPathEvaluationsInput<N,A,V>
Many algorithms such as best first and A* use a traversal tree to browse the underlying
graph. Each node in this tree corresponds to a node in the original graph but has only
one predecessor, which may be updated over time.
The underlying class Node implicitly defines a back pointer PATH from the node to
the root. Therefore, evaluating a node of this class equals evaluating a path in the
original graph.