Class GraphHeuristic.MaxGraphHeuristic

java.lang.Object
edu.uky.cs.nil.sabre.prog.GraphHeuristic
edu.uky.cs.nil.sabre.prog.GraphHeuristic.MaxGraphHeuristic
All Implemented Interfaces:
ProgressionCost
Direct Known Subclasses:
GraphHeuristic.AdmissibleMaxGraphHeuristic, ReachabilityHeuristic, RelaxedPlanHeuristic
Enclosing class:
GraphHeuristic
public static class GraphHeuristic.MaxGraphHeuristic extends GraphHeuristic
A progression cost function that uses a max heuristic graph.
Author:
Stephen G. Ware

  • Field Details

    • graph

      protected final MaxGraph graph
      The max heuristic graph used by this cost function

  • Constructor Details

    • MaxGraphHeuristic

      public MaxGraphHeuristic(MaxGraph graph)
      Constructs a new max graph heuristic from a given max graph.
      Parameters:
      graph - the max graph to use for calculating costs

    • MaxGraphHeuristic

      public MaxGraphHeuristic(CompiledProblem problem, Worker.Status status)
      Constructs a new max graph heuristic and its max graph.
      Parameters:
      problem - that problem for which this heuristic will approximate costs
      status - a status to update while building the max graph

  • Method Details