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

B

basic - package basic
contains all the basic directed search algorithms
BestChoiceStrategy<T> - Class in extended
A hill climbing strategy which selects the best successor upon all successor states.
BestChoiceStrategy() - Constructor for class extended.BestChoiceStrategy
Creates a new BestChoiceStrategy which can be employed in the hill climbing search.
BestFirstSearch<T> - Class in core
This subclass of DirectedSearch is the abstraction of all best first search algorithms like greedy search or A* search.
BestFirstSearch(HeuristicProblem<T>) - Constructor for class core.BestFirstSearch
This method creates a new BestFirstSearch.
BestFirstSearch(HeuristicProblem<T>, boolean) - Constructor for class core.BestFirstSearch
This method creates a new BestFirstSearch.
BestFirstSearch(HeuristicProblem<T>, boolean, boolean) - Constructor for class core.BestFirstSearch
This method creates a new BestFirstSearch.
BidirectionalProblem<T> - Interface in extended
This is the base of all problems which can be solved in the bidirectional search.
BidirectionalSearch<T> - Class in extended
The bidirectional search algorithm is a special blind search able to solve any problem implementing the core.BidirectionalProblem interface.
BidirectionalSearch(BidirectionalProblem<T>) - Constructor for class extended.BidirectionalSearch
Creates a new bidirectional search, with the given problem.
branchedNodes() - Method in class basic.DepthFirstSearch
This method returns the number of expanded nodes during the search.
branchedNodes() - Method in class basic.DepthLimitedSearch
This method returns the number of expanded nodes during the search.
branchedNodes() - Method in class core.DirectedSearch
This method returns the number of expanded nodes during the search.
branchedNodes() - Method in class extended.BidirectionalSearch
This method returns the number of expanded nodes during the search.
BreadthFirstSearch<T> - Class in basic
The breadth first search algorithm is a blind search able to solve any problem implementing the core.Problem interface.
BreadthFirstSearch(Problem<T>) - Constructor for class basic.BreadthFirstSearch
This method creates a new BreadthFirstSearch where implicit duplicate handling is enabled.
BreadthFirstSearch(Problem<T>, boolean) - Constructor for class basic.BreadthFirstSearch
This method creates a new BreadthFirstSearch.

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