Uses of Interface
core.TreeProblem

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

Uses of TreeProblem in basic
 

Fields in basic declared as TreeProblem
protected  TreeProblem<T> DepthLimitedSearch.problem
          holds a reference to the problem to be solved
protected  TreeProblem<T> IterativeDeepeningSearch.problem
          holds a reference to the problem to be solved
 

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

Constructors in basic with parameters of type TreeProblem
DepthLimitedSearch(TreeProblem<T> problem, int limit)
          Create a new DepthLimitedSearch with the given problem, going down to the given limit.
DepthLimitedSearch(TreeProblem<T> problem, int limit, boolean noHash)
          Create a new DepthLimitedSearch with the given problem, going down to the given limit and disabled hashing if the noHash flag is true.
IterativeDeepeningSearch(TreeProblem<T> problem)
          Create a new IterativeDeepeningSearch with the given problem.
IterativeDeepeningSearch(TreeProblem<T> problem, int maximumDepth)
          Create a new IterativeDeepeningSearch with the given problem, which needs at most the given iterations.
IterativeDeepeningSearch(TreeProblem<T> problem, int maximumDepth, boolean noHash)
          Create a new IterativeDeepeningSearch with the given problem, which needs at most the given iterations and disabled hashing if the noHash flag is true.
 

Uses of TreeProblem in core
 

Subinterfaces of TreeProblem in core
 interface HeuristicProblem<T>
          This is the base of all problems which can be solved in an heuristic search.