|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Search | |
---|---|
basic | contains all the basic directed search algorithms |
core | contains most of the Problem interfaces and the abstractions of all search algorithms |
extended | contains more advanced search algorithms and the corresponding problem interfaces |
Uses of Search in basic |
---|
Subclasses of Search 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 |
DepthFirstSearch<T>
The depth first search algorithm is a blind search able to solve any problem implementing the core.Problem interface. |
class |
DepthLimitedSearch<T>
The depth limited search algorithm is a blind search able to solve any problem implementing the core.TreeProblem interface. |
class |
GreedySearch<T>
The greedy search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface. |
class |
IterativeDeepeningAStar<T>
The iterative deepening A* algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface. |
class |
IterativeDeepeningSearch<T>
The iterative deepening search algorithm is a blind search able to solve any problem implementing the core.TreeProblem 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 Search in core |
---|
Subclasses of Search in core | |
---|---|
class |
BestFirstSearch<T>
This subclass of DirectedSearch is the abstraction of all best first search algorithms like greedy search or A* search. |
class |
DirectedSearch<T>
This subclass of Search is the core implementation of most directed search algorithms and is able to perform many various directed search strategies such as depth first, breath first or best first search. |
class |
UndirectedSearch<T>
This subclass of core.Search is the abstraction for every undirected search algorithm such as extended.HillClimbing or extended.SimulatedAnnealing. |
Uses of Search in extended |
---|
Subclasses of Search in extended | |
---|---|
class |
BidirectionalSearch<T>
The bidirectional search algorithm is a special blind search able to solve any problem implementing the core.BidirectionalProblem interface. |
class |
HillClimbing<T>
The hill climbing algorithm is simple local search able to solve any problem implementing the extended.HillClimbingProblem interface. |
class |
SimulatedAnnealing<T>
The simulated annealing search is an advanced local search able to solve any problem implementing the extended.SimulatedAnnealingProblem interface. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |