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

C

canPrepare() - Method in class basic.DepthFirstSearch
This method checks if the given problem returns a valid initial state.
canPrepare() - Method in class basic.DepthLimitedSearch
This method checks if the given problem returns a valid initial state.
canPrepare() - Method in class basic.IterativeDeepeningAStar
This method checks if the given problem returns a valid initial state.
canPrepare() - Method in class basic.IterativeDeepeningSearch
This method checks if the given problem returns a valid initial state.
canPrepare() - Method in class core.DirectedSearch
This method checks if the given problem returns a valid initial state.
canPrepare() - Method in class core.Search
This method is the hook for the preparation of the search and determines if the search can be initialized.
canPrepare() - Method in class extended.BidirectionalSearch
This method checks if the given problem returns valid initial and goal states.
canPrepare() - Method in class extended.HillClimbing
Returns true only there is a strategy and an initial state available.
canPrepare() - Method in class extended.SimulatedAnnealing
This method checks if the given problem returns valid initial states.
clear() - Method in class basic.BreadthFirstSearch
 
clear() - Method in class basic.SlowDepthFirstSearch
 
clear() - Method in class core.BestFirstSearch
This method removes all elements from the queue.
clear() - Method in class core.DirectedSearch
This method is the hook for clearing the queue on preparation of a new search.
clear() - Method in class util.DummyMap
This method does nothing.
clear() - Method in class util.DummySet
This Method does nothing.
clear() - Method in class util.SortedQueue
 
comparator() - Method in class extended.HillClimbing
This method returns the Comparator the HillClimbingProblem implements.
comparator() - Method in class util.SortedQueue
Returns the comparator used to order the elements in this queue, or null if this queue is sorted according to the natural ordering of its elements.
compare(T, T) - Method in class extended.HillClimbing
This method delegates the compare operation to the correct comparator and then inverts the value if necessary (if minimum search is used).
contains(Object) - Method in class util.DummySet
This Method does not check anything but will return false for each Object o.
containsAll(Collection<?>) - Method in class util.DummySet
This Method does not check anything but will return true for each Collection c.
containsKey(Object) - Method in class util.DummyMap
This Method does not check anything but will return false for each Object key.
containsValue(Object) - Method in class util.DummyMap
This Method does not check anything but will return false for each Object value.
core - package core
contains most of the Problem interfaces and the abstractions of all search algorithms
coresult - Variable in class extended.BidirectionalSearch
holding the result of the bottom up search or null if nothing has been found yet

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