Pablo R. Mier

It is more flexible to accept a SearchComponents (instead of a SearchProblem) that provides the basic strategies (double scalar function, double aggregator...) to every algorithm. Each algorithm is responsible of...

Create a package for local search algorithms and implement the Tabu search.

http://en.wikipedia.org/wiki/SMA*

The impl. algorithms automatically discard equivalent paths. It would be interesting to add an option to avoid this default behavior.

Example usage: ``` java graphBuilder .connect("a").to("b") .connect("a").to("b") .build(); ```

Create UninformedSearchComponents / InformedSearchComponents. This is required in order to instantiate uninformed algorithms without generic cost type.