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

S

search() - Method in class basic.DepthFirstSearch
This method looks for a goal in the search domain, by calling a recursive function which expands a state and calls itself for all successor states.
search() - Method in class basic.DepthLimitedSearch
This method looks for a goal in the search domain, by calling a recursive function which expands a state and calls itself for all successor states, until the depth limit is reached.
search() - Method in class basic.IterativeDeepeningAStar
This method looks for a goal by iteratively calling a recursive f-limited search with increasing f-limits.
search() - Method in class basic.IterativeDeepeningSearch
This method looks for a goal by iteratively calling a recursive depth limited search with increasing depth limits.
search() - Method in class core.DirectedSearch
This method looks for a goal in the search domain, by iteratively expanding the first state of the queue and adding all successor state to the queue.
Search<T> - Class in core
This Class is the abstraction of every search algorithm in a generic domain.
Search() - Constructor for class core.Search
Creates a new instance of an abstract search.
search() - Method in class core.Search
This method is the hook for any concrete implementation of a search algorithm and will be called from inside the run method.
search() - Method in class extended.BidirectionalSearch
This method implements the bidirectional search algorithm, which can be described in the following way: add problem.initial() to top down queue add problem.goal() to bottom up queue until top down queue and bottom up queue is not empty do pop first element from top down queue and assign it to upper pop first element from bottom up queue and assign it to lower terminate the search if upper can be found in the bottom up queue terminate the search if lower can be found in the top down queue for each node problem.expand(upper) do add node to top down queue for each node problem.implode(lower) do add node to bottom up queue
search() - Method in class extended.HillClimbing
This method fills the hook which implements the actual HillClimbing algorithm.
search() - Method in class extended.SimulatedAnnealing
In detail the search algorithm can be described in the following way: current = problem.initial(); result = current; while( running() ){ next = select_random_successor(current); delta = difference(current, next); if ( (delta > 0) || (random.nextDouble() < Math.exp( delta / temperature ) ) current = next; if (difference(result,current) > 0){ result = current; else temperature = temperature * factor; }
searchMaximum() - Method in class core.UndirectedSearch
This method tells the search to look for maximum values.
searchMinimum() - Method in class core.UndirectedSearch
This method tells the search to look for minimum values.
select(HillClimbing<T>, List<T>, T) - Method in class extended.BestChoiceStrategy
This method selects the best state of all states in the extension list.
select(HillClimbing<T>, List<T>, T) - Method in class extended.FirstChoiceStrategy
This method selects the first state in the extension list which is better then the current state.
select(HillClimbing<T>, List<T>, T) - Method in interface extended.HillClimbingStrategy
This method selects the best state from the given list of successors according to the current state and a comparator.
set(int, int) - Method in class util.PackedArray
Replaces the element at the specified position in this list with the specified element.
setFactor(double) - Method in class extended.SimulatedAnnealing
This method resets the factor by which the temperature will be lowered during a search run.
setInitialTemperature(double) - Method in class extended.SimulatedAnnealing
This method resets the initial temperature of the search to the given value.
setMaximumDepth(int) - Method in class basic.IterativeDeepeningSearch
Changes the maximal number of iterations to the given value.
setMaxSame(int) - Method in class extended.SimulatedAnnealing
This method resets the amount of steps without improvements to the search result.
setSideSteps(int) - Method in class extended.HillClimbing
This method resets the number of allowed side steps to the given value.
setStrategy(HillClimbingStrategy<T>) - Method in class extended.HillClimbing
This method replaces the used strategy by the given one.
setStrategy(HillClimbing.EStrategy) - Method in class extended.HillClimbing
This method replaces the used strategy by the selected default strategy.
SimulatedAnnealing<T> - Class in extended
The simulated annealing search is an advanced local search able to solve any problem implementing the extended.SimulatedAnnealingProblem interface.
SimulatedAnnealing(SimulatedAnnealingProblem<T>) - Constructor for class extended.SimulatedAnnealing
Creates a new simulated annealing search with the given problem.
SimulatedAnnealing(SimulatedAnnealingProblem<T>, boolean) - Constructor for class extended.SimulatedAnnealing
Creates a new simulated annealing search, with the given problem and the direction given by the minimum flag.
SimulatedAnnealing(SimulatedAnnealingProblem<T>, boolean, double, double, int) - Constructor for class extended.SimulatedAnnealing
Creates a new simulated annealing search, with the given problem, the direction given by the minimum flag, the initial temperature, the cooling factor and the maximal number of steps without improvements.
SimulatedAnnealing(SimulatedAnnealingProblem<T>, double, double) - Constructor for class extended.SimulatedAnnealing
Creates a new simulated annealing search, with the given problem, the initial temperature and the cooling factor.
SimulatedAnnealing(SimulatedAnnealingProblem<T>, boolean, double, double) - Constructor for class extended.SimulatedAnnealing
Creates a new simulated annealing search, with the given problem, the direction given by the minimum flag, the initial temperature and the cooling factor.
SimulatedAnnealingProblem<T> - Interface in extended
This is the base of all problems which can be solved with the simulated annealing search.
size() - Method in class util.DummyMap
This Method will always return 0 because the map is always empty.
size() - Method in class util.DummySet
This Method will always return 0 because the set is always empty.
size() - Method in class util.SortedQueue
 
SlowDepthFirstSearch<T> - Class in basic
A slow implementation of the depth first search algorithm which uses the general search algorithm implemented in the core.DirectedSearch.
SlowDepthFirstSearch(Problem<T>) - Constructor for class basic.SlowDepthFirstSearch
This method creates a new BreadthFirstSearch where implicit duplicate duplicate handling is enabled.
SlowDepthFirstSearch(Problem<T>, boolean) - Constructor for class basic.SlowDepthFirstSearch
This method creates a new SlowDepthFirstSearch.
SortedQueue<E> - Class in util
An unbounded sorted queue able to update its elements.
SortedQueue() - Constructor for class util.SortedQueue
Creates a SortedQueue that orders its elements according to their natural ordering.
SortedQueue(Comparator<? super E>) - Constructor for class util.SortedQueue
Creates a SortedQueue with the specified initial capacity that orders its elements according to the specified comparator.
SortedQueue(Collection<E>) - Constructor for class util.SortedQueue
Creates a SortedQueue containing the elements in the specified collection.
SortedQueue(SortedSet<E>) - Constructor for class util.SortedQueue
Creates a SortedQueue containing the elements in the specified sorted set.
SortedQueue(PriorityQueue<E>) - Constructor for class util.SortedQueue
Creates a SortedQueue containing the elements in the specified priority queue.
SortedQueue(SortedQueue<E>) - Constructor for class util.SortedQueue
Creates a SortedQueue containing the elements in the specified sorted queue.
stop() - Method in class core.Search
This method stops a running search.
strategy - Variable in class extended.HillClimbing
holds the strategy used during the search
SystemInput - Class in util
This class only contains static methods to use the standard input.
SystemInput() - Constructor for class util.SystemInput
 

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