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

A

add(T) - Method in class basic.BreadthFirstSearch
 
add(T) - Method in class basic.SlowDepthFirstSearch
 
add(T) - Method in class core.BestFirstSearch
This method adds a new state to the queue.
add(T) - Method in class core.DirectedSearch
This method is the hook for adding new states to the queue during the search.
add(E) - Method in class util.DummySet
This Method does not store anything but will return true for each e.
addAll(Collection<? extends E>) - Method in class util.DummySet
This Method does not store anything but will return true for each Collection c.
AStarSearch<T> - Class in basic
The A* search algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface.
AStarSearch(HeuristicProblem<T>) - Constructor for class basic.AStarSearch
Creates a new AStarSearch with the given problem.
AStarSearch(HeuristicProblem<T>, boolean) - Constructor for class basic.AStarSearch
Create a new AStarSearch with the given problem and a queue corresponding to the given update flag.
AStarSearch(HeuristicProblem<T>, boolean, boolean) - Constructor for class basic.AStarSearch
Create a new AStarSearch with the given problem, disabled hashing if the noHash flag is true and a queue corresponding to the given update flag.

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