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

D

depth(T) - Method in interface core.TreeProblem
Returns the depth of the given state in the search tree.
DepthFirstSearch<T> - Class in basic
The depth first search algorithm is a blind search able to solve any problem implementing the core.Problem interface.
DepthFirstSearch(Problem<T>) - Constructor for class basic.DepthFirstSearch
Creates a new DepthFirstSearch with the given problem.
DepthFirstSearch(Problem<T>, boolean) - Constructor for class basic.DepthFirstSearch
Create a new DepthFirstSearch with the given problem and disabled hashing if the noHash flag is true.
depthLimit() - Method in class basic.DepthLimitedSearch
This method returns the depth to which the search domain will be explored
DepthLimitedSearch<T> - Class in basic
The depth limited search algorithm is a blind search able to solve any problem implementing the core.TreeProblem interface.
DepthLimitedSearch(TreeProblem<T>, int) - Constructor for class basic.DepthLimitedSearch
Create a new DepthLimitedSearch with the given problem, going down to the given limit.
DepthLimitedSearch(TreeProblem<T>, int, boolean) - Constructor for class basic.DepthLimitedSearch
Create a new DepthLimitedSearch with the given problem, going down to the given limit and disabled hashing if the noHash flag is true.
difference(T, T) - Method in class extended.SimulatedAnnealing
This method delegates the difference operation to the problem description and then inverts the result if necessary (if minimum search is used).
difference(T, T) - Method in interface extended.SimulatedAnnealingProblem
Computes the difference between two states in the search domain.
DirectedSearch<T> - Class in core
This subclass of Search is the core implementation of most directed search algorithms and is able to perform many various directed search strategies such as depth first, breath first or best first search.
DirectedSearch(Problem<T>) - Constructor for class core.DirectedSearch
Creates a new directed search with the given problem.
DirectedSearch(Problem<T>, boolean) - Constructor for class core.DirectedSearch
Creates a new directed search with the given problem and a flag indicating whether duplicate handling should be turned off.
DummyMap<K,V> - Class in util
The DummyMap can be used to remove the space consuming behavior and retain the checking behavior of a map.
DummyMap() - Constructor for class util.DummyMap
Creates a new instance of DummyMap
DummySet<E> - Class in util
The DummySet can be used to remove the space consuming behavior and retain the checking behavior of a set.
DummySet() - Constructor for class util.DummySet
Creates a new DummySet instance.

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