|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use HillClimbingProblem | |
---|---|
extended | contains more advanced search algorithms and the corresponding problem interfaces |
Uses of HillClimbingProblem in extended |
---|
Fields in extended declared as HillClimbingProblem | |
---|---|
protected HillClimbingProblem<T> |
HillClimbing.problem
holds a reference to the problem to be solved |
Methods in extended that return HillClimbingProblem | |
---|---|
HillClimbingProblem<T> |
HillClimbing.getProblem()
This method returns the problem, with which this search has been created. |
Constructors in extended with parameters of type HillClimbingProblem | |
---|---|
HillClimbing(HillClimbingProblem<T> problem)
Creates a new hill climbing search, with the given problem. |
|
HillClimbing(HillClimbingProblem<T> problem,
boolean minimum,
HillClimbing.EStrategy strategy)
Creates a new hill climbing search, with the given problem and the direction given by the minimum flag. |
|
HillClimbing(HillClimbingProblem<T> problem,
boolean minimum,
HillClimbing.EStrategy strategy,
int sideSteps)
Creates a new hill climbing search, with the given problem, the direction given by the minimum flag and the allowed number of sideSteps. |
|
HillClimbing(HillClimbingProblem<T> problem,
boolean minimum,
HillClimbingStrategy<T> strategy,
int sideSteps)
Creates a new hill climbing search, with the given problem, the direction given by the minimum flag and the allowed number of sideSteps. |
|
HillClimbing(HillClimbingProblem<T> problem,
HillClimbing.EStrategy strategy)
Creates a new hill climbing search, with the given problem and the selected strategy. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |