Uses of Interface
core.HeuristicProblem

Packages that use HeuristicProblem
basic contains all the basic directed search algorithms 
core contains most of the Problem interfaces and the abstractions of all search algorithms 
 

Uses of HeuristicProblem in basic
 

Fields in basic declared as HeuristicProblem
protected  HeuristicProblem<T> IterativeDeepeningAStar.problem
          holds a reference to the problem to be solved
 

Methods in basic that return HeuristicProblem
 HeuristicProblem<T> IterativeDeepeningAStar.getProblem()
          This method returns the problem, with which this search has been created.
 

Constructors in basic with parameters of type HeuristicProblem
AStarSearch(HeuristicProblem<T> problem)
          Creates a new AStarSearch with the given problem.
AStarSearch(HeuristicProblem<T> problem, boolean update)
          Create a new AStarSearch with the given problem and a queue corresponding to the given update flag.
AStarSearch(HeuristicProblem<T> problem, boolean noHash, boolean update)
          Create a new AStarSearch with the given problem, disabled hashing if the noHash flag is true and a queue corresponding to the given update flag.
GreedySearch(HeuristicProblem<T> problem)
          This method creates a new GreedySearch.
GreedySearch(HeuristicProblem<T> problem, boolean update)
          This method creates a new GreedySearch.
GreedySearch(HeuristicProblem<T> problem, boolean noHash, boolean update)
          This method creates a new GreedySearch.
IterativeDeepeningAStar(HeuristicProblem<T> problem)
          Create a new IterativeDeepeningAStar with the given problem.
IterativeDeepeningAStar(HeuristicProblem<T> problem, boolean noHash)
          Create a new IterativeDeepeningAStar with the given problem and disabled hashing if the noHash flag is true.
UniformCostSearch(HeuristicProblem<T> problem)
          This method creates a new UniformCostSearch.
UniformCostSearch(HeuristicProblem<T> problem, boolean update)
          This method creates a new UniformCostSearch.
UniformCostSearch(HeuristicProblem<T> problem, boolean noHash, boolean update)
          This method creates a new UniformCostSearch.
 

Uses of HeuristicProblem in core
 

Fields in core declared as HeuristicProblem
protected  HeuristicProblem<T> BestFirstSearch.heuristicProblem
          holds a reference to the problem to be solved of the actual type
 

Methods in core that return HeuristicProblem
 HeuristicProblem<T> BestFirstSearch.getProblem()
           
 

Constructors in core with parameters of type HeuristicProblem
BestFirstSearch(HeuristicProblem<T> problem)
          This method creates a new BestFirstSearch.
BestFirstSearch(HeuristicProblem<T> problem, boolean update)
          This method creates a new BestFirstSearch.
BestFirstSearch(HeuristicProblem<T> problem, boolean noHash, boolean update)
          This method creates a new BestFirstSearch.