Uses of Class
core.BestFirstSearch

Packages that use BestFirstSearch
basic contains all the basic directed search algorithms 
 

Uses of BestFirstSearch in basic
 

Subclasses of BestFirstSearch in basic
 class AStarSearch<T>
          The A* search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface.
 class GreedySearch<T>
          The greedy search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface.
 class UniformCostSearch<T>
          The uniform cost search algorithm is a blind search able to solve any problem implementing the core.HeuristicProblem interface.