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

I

implode(T) - Method in interface extended.BidirectionalProblem
Generates all predecessor states of the given state.
initial() - Method in interface core.Problem
Returns the starting state of the search.
initialize() - Method in class core.Search
This method initializes the search if possible and if it is not already initialized.
initialized() - Method in class core.Search
This method tells you whether a search is initialized (and can be performed) or not.
inject(int, int, int, int) - Static method in class util.PackedArray
This method injects the given value into a section of the given integer.
isEmpty() - Method in class util.DummyMap
This method will always return true, because this map will always be empty.
isEmpty() - Method in class util.DummySet
This Method will always return false because the set is always empty.
isEmpty() - Method in class util.SortedQueue
 
isGoal(T) - Method in interface core.Problem
Checks whether a given state is a goal of the search or not.
IterativeDeepeningAStar<T> - Class in basic
The iterative deepening A* algorithm is a heuristic search able to solve any problem implementing the core.HeuristicProblem interface.
IterativeDeepeningAStar(HeuristicProblem<T>) - Constructor for class basic.IterativeDeepeningAStar
Create a new IterativeDeepeningAStar with the given problem.
IterativeDeepeningAStar(HeuristicProblem<T>, boolean) - Constructor for class basic.IterativeDeepeningAStar
Create a new IterativeDeepeningAStar with the given problem and disabled hashing if the noHash flag is true.
IterativeDeepeningSearch<T> - Class in basic
The iterative deepening search algorithm is a blind search able to solve any problem implementing the core.TreeProblem interface.
IterativeDeepeningSearch(TreeProblem<T>) - Constructor for class basic.IterativeDeepeningSearch
Create a new IterativeDeepeningSearch with the given problem.
IterativeDeepeningSearch(TreeProblem<T>, int) - Constructor for class basic.IterativeDeepeningSearch
Create a new IterativeDeepeningSearch with the given problem, which needs at most the given iterations.
IterativeDeepeningSearch(TreeProblem<T>, int, boolean) - Constructor for class basic.IterativeDeepeningSearch
Create a new IterativeDeepeningSearch with the given problem, which needs at most the given iterations and disabled hashing if the noHash flag is true.
iterator() - Method in class util.DummySet
This Method will always return an empty iterator because the set is always empty.
iterator() - Method in class util.SortedQueue
Returns an iterator over the elements of this queue.

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