Class GraphSearchProblemInputToGraphSearchWithSubpathEvaluationViaUninformedness<N,​A>

  • Type Parameters:
    N - Node Type
    A - Arc Type This reduction will create a problem in which each inner node is evaluated with 0.0, and each leaf node with the value given by the path evaluator. The given path evaluator is, by contract, just applicable to leaf nodes, so it is just used there, and everywhere else we use just a constant 0.0.
    All Implemented Interfaces:
    ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,​A>,​EvaluatedSearchGraphPath<N,​A,​java.lang.Double>,​GraphSearchWithSubpathEvaluationsInput<N,​A,​java.lang.Double>,​EvaluatedSearchGraphPath<N,​A,​java.lang.Double>>

    public class GraphSearchProblemInputToGraphSearchWithSubpathEvaluationViaUninformedness<N,​A>
    extends GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<N,​A,​java.lang.Double>