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

F

f(T) - Method in class basic.AStarSearch
This method estimates the costs to reach a goal state from the initial state over the given state.
f(T) - Method in class basic.GreedySearch
This method estimates the costs to reach a goal state from the given state.
f(T) - Method in class basic.IterativeDeepeningAStar
This method estimates the costs to reach a goal state from the initial state over the given state.
f(T) - Method in class basic.UniformCostSearch
This method evaluates a state according to the sum of the path costs from the initial state.
f(T) - Method in class core.BestFirstSearch
This method is the hook for evaluating states during insertion into the queue.
finalize() - Method in class core.DirectedSearch
 
finalize() - Method in class core.Search
This method frees the search.
finalize() - Method in class extended.BidirectionalSearch
Clears and Frees the queues and Hashes used in this search.
FirstChoiceStrategy<T> - Class in extended
A hill climbing strategy which selects the first successor which is better then the current state.
FirstChoiceStrategy() - Constructor for class extended.FirstChoiceStrategy
Creates a new FirstChoiceStrategy which can be employed in the hill climbing search.

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