Package core

contains most of the Problem interfaces and the abstractions of all search algorithms

See:
          Description

Interface Summary
HeuristicProblem<T> This is the base of all problems which can be solved in an heuristic search.
Problem<T> This is the base of all problems which can be solved with the Search framework.
TreeProblem<T> This is the base of all problems which can be solved in a tree based search.
 

Class Summary
BestFirstSearch<T> This subclass of DirectedSearch is the abstraction of all best first search algorithms like greedy search or A* search.
DirectedSearch<T> 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.
Search<T> This Class is the abstraction of every search algorithm in a generic domain.
UndirectedSearch<T> This subclass of core.Search is the abstraction for every undirected search algorithm such as extended.HillClimbing or extended.SimulatedAnnealing.
 

Package core Description

contains most of the Problem interfaces and the abstractions of all search algorithms