Uses of Package
core

Packages that use core
basic contains all the basic directed search algorithms 
core contains most of the Problem interfaces and the abstractions of all search algorithms 
extended contains more advanced search algorithms and the corresponding problem interfaces 
 

Classes in core used by basic
BestFirstSearch
          This subclass of DirectedSearch is the abstraction of all best first search algorithms like greedy search or A* search.
DirectedSearch
          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.
HeuristicProblem
          This is the base of all problems which can be solved in an heuristic search.
Problem
          This is the base of all problems which can be solved with the Search framework.
Search
          This Class is the abstraction of every search algorithm in a generic domain.
TreeProblem
          This is the base of all problems which can be solved in a tree based search.
 

Classes in core used by core
DirectedSearch
          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.
HeuristicProblem
          This is the base of all problems which can be solved in an heuristic search.
Problem
          This is the base of all problems which can be solved with the Search framework.
Search
          This Class is the abstraction of every search algorithm in a generic domain.
TreeProblem
          This is the base of all problems which can be solved in a tree based search.
 

Classes in core used by extended
Problem
          This is the base of all problems which can be solved with the Search framework.
Search
          This Class is the abstraction of every search algorithm in a generic domain.
UndirectedSearch
          This subclass of core.Search is the abstraction for every undirected search algorithm such as extended.HillClimbing or extended.SimulatedAnnealing.