|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Class Summary | |
---|---|
AStarSearch<T> | The A* search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface. |
BreadthFirstSearch<T> | The breadth first search algorithm is a blind search able to solve any problem implementing the core.Problem interface. |
DepthFirstSearch<T> | The depth first search algorithm is a blind search able to solve any problem implementing the core.Problem interface. |
DepthLimitedSearch<T> | The depth limited search algorithm is a blind search able to solve any problem implementing the core.TreeProblem interface. |
GreedySearch<T> | The greedy search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface. |
IterativeDeepeningAStar<T> | The iterative deepening A* algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface. |
IterativeDeepeningSearch<T> | The iterative deepening search algorithm is a blind search able to solve any problem implementing the core.TreeProblem interface. |
SlowDepthFirstSearch<T> | A slow implementation of the depth first search algorithm which uses the general search algorithm implemented in the core.DirectedSearch. |
UniformCostSearch<T> | The uniform cost search algorithm is a blind search able to solve any problem implementing the core.HeuristicProblem interface. |
contains all the basic directed search algorithms
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |