Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
K
L
M
N
O
P
Q
R
S
T
U
V
P
packed()
- Method in class util.
PackedArray
Returns the internal representation of the integer array.
PackedArray
- Class in
util
This is the implementation of a simple packing algorithm, to reduce the size of an integer array with a fixed number of positive elements and where the highest value is known.
PackedArray(PackedArray)
- Constructor for class util.
PackedArray
Creates a new copy of the given packed array.
PackedArray(int[], int)
- Constructor for class util.
PackedArray
Creates a new PackedArray by packing the given integer array to a from where at least values of the given high can be stored.
peek()
- Method in class util.
SortedQueue
Returns but retains the smallest element in the queue.
poll()
- Method in class util.
SortedQueue
Returns and removes the smallest element in the queue.
pop()
- Method in class basic.
BreadthFirstSearch
pop()
- Method in class basic.
SlowDepthFirstSearch
pop()
- Method in class core.
BestFirstSearch
This method returns the best state according to the function value.
pop()
- Method in class core.
DirectedSearch
This method is the hook for extracting the first element of the queue during the search.
prepare()
- Method in class basic.
DepthFirstSearch
This method clears the hash used for duplicate handling to prepare it for a new search run.
prepare()
- Method in class basic.
DepthLimitedSearch
This method clears the hash used for duplicate handling to prepare it for a new search run.
prepare()
- Method in class basic.
IterativeDeepeningAStar
This method does nothing.
prepare()
- Method in class basic.
IterativeDeepeningSearch
This method does nothing.
prepare()
- Method in class core.
DirectedSearch
This method clears the queue and the hash used for duplicate handling to prepare them for a new search run.
prepare()
- Method in class core.
Search
This method is the hook for the preparation of the search and will be called from inside the initialize method.
prepare()
- Method in class extended.
BidirectionalSearch
This method clears the hashes and queues to prepare them for a new search run.
prepare()
- Method in class extended.
HillClimbing
Initializes the number of needed side steps.
prepare()
- Method in class extended.
SimulatedAnnealing
This method does nothing.
problem
- Variable in class basic.
DepthFirstSearch
holds a reference to the problem to be solved
problem
- Variable in class basic.
DepthLimitedSearch
holds a reference to the problem to be solved
problem
- Variable in class basic.
IterativeDeepeningAStar
holds a reference to the problem to be solved
problem
- Variable in class basic.
IterativeDeepeningSearch
holds a reference to the problem to be solved
problem
- Variable in class core.
DirectedSearch
holds the problem to be solved during the search
Problem
<
T
> - Interface in
core
This is the base of all problems which can be solved with the Search framework.
problem
- Variable in class extended.
BidirectionalSearch
holds a reference to the problem to be solved
problem
- Variable in class extended.
HillClimbing
holds a reference to the problem to be solved
problem
- Variable in class extended.
SimulatedAnnealing
holds a reference to the problem to be solved
put(K, V)
- Method in class util.
DummyMap
This Method does not store anything but will return null for each key, value pair.
putAll(Map<? extends K, ? extends V>)
- Method in class util.
DummyMap
This Method does nothing.
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
K
L
M
N
O
P
Q
R
S
T
U
V