| Interface | Description |
|---|---|
| ICancelableNodeEvaluator | |
| INodeEvaluator<T,V extends java.lang.Comparable<V>> | |
| IPotentiallyGraphDependentNodeEvaluator<T,V extends java.lang.Comparable<V>> | |
| IPotentiallySolutionReportingNodeEvaluator<T,V extends java.lang.Comparable<V>> |
This interface suggests that the node evaluator MAY report solutions that he finds under a node.
|
| IPotentiallyUncertaintyAnnotatingNodeEvaluator<N,V extends java.lang.Comparable<V>> |
| Class | Description |
|---|---|
| AlternativeNodeEvaluator<T,V extends java.lang.Comparable<V>> |
This node evaluator can be used
a) if there is a prioritized node evaluator that should be used unless it returns NULL
b) to realize dead-end recognition
c) to use different node evaluators in different regions of the search graph
|
| DecoratingNodeEvaluator<T,V extends java.lang.Comparable<V>> | |
| LinearCombiningNodeEvaluator<T> | |
| RandomCompletionBasedNodeEvaluator<T,A,V extends java.lang.Comparable<V>> | |
| RandomizedDepthFirstNodeEvaluator<T> | |
| SkippingNodeEvaluator<T,V extends java.lang.Comparable<V>> | |
| TimeAwareNodeEvaluator<T,V extends java.lang.Comparable<V>> |
This class can be used to create node evaluators with a time limit for the evaluation of each node.
|
| TimeLoggingNodeEvaluator<T,V extends java.lang.Comparable<V>> |