A B C D E F G H I K L M N O P Q R S T U V

G

g(T) - Method in interface core.HeuristicProblem
This method returns the sum of all path costs from the initial to the given state.
get(Object) - Method in class util.DummyMap
This method will return null for every given key.
get(int) - Method in class util.PackedArray
Returns the element at the specified position in the packed array.
getFactor() - Method in class extended.SimulatedAnnealing
Returns the factor by which the temperature will be lowered on each iteration.
getHitFromBottom() - Method in class extended.BidirectionalSearch
Returns the state where the top down search and the bottom up search hit each other or null if no such state could be found.
getHitFromTop() - Method in class extended.BidirectionalSearch
Returns the state where the top down search and the bottom up search hit each other or null if no such state could be found.
getInitialTemperature() - Method in class extended.SimulatedAnnealing
Returns the temperature at the beginning of each search run
getMaximumDepth() - Method in class basic.IterativeDeepeningSearch
Returns the maximal depth to which the search tree will be explored.
getMaxSame() - Method in class extended.SimulatedAnnealing
Returns the maximum amount of steps without improvement to the search result, before the search terminates.
getProblem() - Method in class basic.DepthFirstSearch
This method returns the problem, with which this search has been created.
getProblem() - Method in class basic.DepthLimitedSearch
This method returns the problem, with which this search has been created.
getProblem() - Method in class basic.IterativeDeepeningAStar
This method returns the problem, with which this search has been created.
getProblem() - Method in class basic.IterativeDeepeningSearch
This method returns the problem, with which this search has been created.
getProblem() - Method in class core.BestFirstSearch
 
getProblem() - Method in class core.DirectedSearch
This method returns the problem, with which this search has been created.
getProblem() - Method in class extended.BidirectionalSearch
This method returns the problem, with which this search has been created.
getProblem() - Method in class extended.HillClimbing
This method returns the problem, with which this search has been created.
getProblem() - Method in class extended.SimulatedAnnealing
This method returns the problem, with which this search has been created.
getResult() - Method in class core.Search
This method returns the generic solution in the domain of the search.
getStrategy() - Method in class extended.HillClimbing
This method returns the actual HillClimbingStrategy used during the search.
goal() - Method in interface extended.BidirectionalProblem
Returns the goal state of the search.
GreedySearch<T> - Class in basic
The greedy search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface.
GreedySearch(HeuristicProblem<T>) - Constructor for class basic.GreedySearch
This method creates a new GreedySearch.
GreedySearch(HeuristicProblem<T>, boolean) - Constructor for class basic.GreedySearch
This method creates a new GreedySearch.
GreedySearch(HeuristicProblem<T>, boolean, boolean) - Constructor for class basic.GreedySearch
This method creates a new GreedySearch.

A B C D E F G H I K L M N O P Q R S T U V