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

U

UndirectedSearch<T> - Class in core
This subclass of core.Search is the abstraction for every undirected search algorithm such as extended.HillClimbing or extended.SimulatedAnnealing.
UndirectedSearch(boolean) - Constructor for class core.UndirectedSearch
Creates a new undirected search in the desired direction.
UniformCostSearch<T> - Class in basic
The uniform cost search algorithm is a blind search able to solve any problem implementing the core.HeuristicProblem interface.
UniformCostSearch(HeuristicProblem<T>) - Constructor for class basic.UniformCostSearch
This method creates a new UniformCostSearch.
UniformCostSearch(HeuristicProblem<T>, boolean) - Constructor for class basic.UniformCostSearch
This method creates a new UniformCostSearch.
UniformCostSearch(HeuristicProblem<T>, boolean, boolean) - Constructor for class basic.UniformCostSearch
This method creates a new UniformCostSearch.
unpack() - Method in class util.PackedArray
Unpacks the internal representation to a full integer array where every value is stored in every element.
util - package util
contains some helper classes used by this framework

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