Uses of Class
core.DirectedSearch

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

Uses of DirectedSearch in basic
 

Subclasses of DirectedSearch in basic
 class AStarSearch<T>
          The A* search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface.
 class BreadthFirstSearch<T>
          The breadth first search algorithm is a blind search able to solve any problem implementing the core.Problem interface.
 class GreedySearch<T>
          The greedy search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface.
 class SlowDepthFirstSearch<T>
          A slow implementation of the depth first search algorithm which uses the general search algorithm implemented in the core.DirectedSearch.
 class UniformCostSearch<T>
          The uniform cost search algorithm is a blind search able to solve any problem implementing the core.HeuristicProblem interface.
 

Uses of DirectedSearch in core
 

Subclasses of DirectedSearch in core
 class BestFirstSearch<T>
          This subclass of DirectedSearch is the abstraction of all best first search algorithms like greedy search or A* search.