|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Problem | |
---|---|
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 Problem in basic |
---|
Fields in basic declared as Problem | |
---|---|
protected Problem<T> |
DepthFirstSearch.problem
holds a reference to the problem to be solved |
Methods in basic that return Problem | |
---|---|
Problem<T> |
DepthFirstSearch.getProblem()
This method returns the problem, with which this search has been created. |
Constructors in basic with parameters of type Problem | |
---|---|
BreadthFirstSearch(Problem<T> problem)
This method creates a new BreadthFirstSearch where implicit duplicate handling is enabled. |
|
BreadthFirstSearch(Problem<T> problem,
boolean noHash)
This method creates a new BreadthFirstSearch. |
|
DepthFirstSearch(Problem<T> problem)
Creates a new DepthFirstSearch with the given problem. |
|
DepthFirstSearch(Problem<T> problem,
boolean noHash)
Create a new DepthFirstSearch with the given problem and disabled hashing if the noHash flag is true. |
|
SlowDepthFirstSearch(Problem<T> problem)
This method creates a new BreadthFirstSearch where implicit duplicate duplicate handling is enabled. |
|
SlowDepthFirstSearch(Problem<T> problem,
boolean noHash)
This method creates a new SlowDepthFirstSearch. |
Uses of Problem in core |
---|
Subinterfaces of Problem in core | |
---|---|
interface |
HeuristicProblem<T>
This is the base of all problems which can be solved in an heuristic search. |
interface |
TreeProblem<T>
This is the base of all problems which can be solved in a tree based search. |
Fields in core declared as Problem | |
---|---|
protected Problem<T> |
DirectedSearch.problem
holds the problem to be solved during the search |
Methods in core that return Problem | |
---|---|
Problem<T> |
DirectedSearch.getProblem()
This method returns the problem, with which this search has been created. |
Constructors in core with parameters of type Problem | |
---|---|
DirectedSearch(Problem<T> problem)
Creates a new directed search with the given problem. |
|
DirectedSearch(Problem<T> problem,
boolean noHash)
Creates a new directed search with the given problem and a flag indicating whether duplicate handling should be turned off. |
Uses of Problem in extended |
---|
Subinterfaces of Problem in extended | |
---|---|
interface |
BidirectionalProblem<T>
This is the base of all problems which can be solved in the bidirectional search. |
interface |
HillClimbingProblem<T>
This is the base of all problems which can be solved with the hill climbing search. |
interface |
SimulatedAnnealingProblem<T>
This is the base of all problems which can be solved with the simulated annealing search. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |