N - A - V - public class DyadRankedBestFirstFactory<N,A,V extends java.lang.Comparable<V>> extends StandardBestFirstFactory<N,A,V>
| Constructor and Description |
|---|
DyadRankedBestFirstFactory(IBestFirstQueueConfiguration<GraphSearchWithSubpathEvaluationsInput<N,A,V>,N,A,V> openConfig)
Construct a new factory that makes best first search objects using the given
config.
|
| Modifier and Type | Method and Description |
|---|---|
BestFirst<GraphSearchWithSubpathEvaluationsInput<N,A,V>,N,A,V> |
getAlgorithm() |
getLoggerName, getPreferredNodeEvaluator, setGraphGenerator, setLoggerName, setNodeEvaluator, setPreferredNodeEvaluator, toStringgetAlgorithm, getTimeoutEvaluator, getTimeoutForFInMS, setTimeoutForFComputation, setupAlgorithmpublic DyadRankedBestFirstFactory(IBestFirstQueueConfiguration<GraphSearchWithSubpathEvaluationsInput<N,A,V>,N,A,V> openConfig)
openConfig - parameters for the OPEN list rankingpublic BestFirst<GraphSearchWithSubpathEvaluationsInput<N,A,V>,N,A,V> getAlgorithm()
getAlgorithm in interface ai.libs.jaicore.basic.algorithm.IAlgorithmFactory<GraphSearchWithSubpathEvaluationsInput<N,A,V extends java.lang.Comparable<V>>,EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>>>getAlgorithm in interface ai.libs.jaicore.basic.algorithm.IOptimizationAlgorithmFactory<GraphSearchWithSubpathEvaluationsInput<N,A,V extends java.lang.Comparable<V>>,EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>>,V extends java.lang.Comparable<V>>getAlgorithm in interface IGraphSearchFactory<GraphSearchWithSubpathEvaluationsInput<N,A,V extends java.lang.Comparable<V>>,EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>>,N,A>getAlgorithm in interface IOptimalPathInORGraphSearchFactory<GraphSearchWithSubpathEvaluationsInput<N,A,V extends java.lang.Comparable<V>>,N,A,V extends java.lang.Comparable<V>>getAlgorithm in class StandardBestFirstFactory<N,A,V extends java.lang.Comparable<V>>