citiususc/hipster

Hipster4j is a lightweight and powerful heuristic search library for Java and Android. It contains common, fully customizable algorithms such as Dijkstra, A* (A-Star), DFS, BFS, Bellman-Ford and more.

hipster's Issues

Prepare the release of the 0.1.0 version

Bump POM versions to 0.1.0. Integrate the changes in a new branch release-0.1.0. Merge back to master and tag.

Cannot access the heuristic from HeuristicNode

Add getHeuristic method to HeuristicNode interface.

Implementation of the ARA* algorithm

Link: http://books.nips.cc/papers/files/nips16/NIPS2003_CN03.pdf

Floyd–Warshall algorithm for all-pair shortest paths

Customize doclava css for javadoc

8-Puzzle example with different heuristics

Implement manhattan distance heuristic for 8-puzzle using A*

Implementation of the D* Lite algorithm

Link: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1435479&tag=1

Insert pluginManagement in parent pom

Plugins such as javadoc / sources / ... should be defined in the parent pom using pluginDependency tag to let each sub-module decide whether to use it or not.

Reorganize maven modules

New maven modules organization:

• hipster-core: same as the current maven module. In the future may split into api, collections and algorithms.
• hipster-examples: examples moved from core example packages.
• hipster-jung: distribution pom for hipster with jung adapters.
• hipster-jgrapht: distribution pom for hipster with jgrapht adapters.

Pretty 8-puzzle string representation

Override toString method to print 8-puzzle states in a pretty way, transformin the plain array {1,0,2,3,4,5,6,7,8} into something like:
| 1 0 2 |
| 3 4 5 |
| 6 7 8 |

Change factory.node to factory.makeNode

I think makeNode is more clear

Complete javadoc documentation for hipster.algorithm.multiobjective (core)

Complete javadoc documentation for hipster.algorithm.function.impl

Complete javadoc documentation for hipster.algorithm.problem (core)

Clean algorithm factory duplications

Some algorithm factories are identical for similar algorithms (for example, A factory and IDA factory). NOTE: This implies the reuse of factories and there are incompatibilities between generic nodes.

SetCoverIterator fails when there is only one element

Add unit test to check this case

Input:

Set<Set<String>> sets = new HashSet<String>();
sets.add(Collections.singleton("A"));

Expected output:

List<Set<String>> result = compute();
assertEquals(1, result.size());
assertEquals("A", result.get(0).iterator().next());

Implement the iterative deepening depth-first search (IDDFS)

Add test for HashQueue

Create README.md with markdown

Move examples to a hipster-examples package

Implementation of the Focussed D* algorithm

Link: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.6615

Implement AO* (AND/OR search)

Implementation of the bidirectional heuristic path algorithm (BHPA)

Implement AD* replanning test

Maze search examples with realtime output printing

Complete javadoc documentation for hipster.function (core)

Generate maven site with markdown with reflow maven skin

Generate the full site for deployment using a bootstrap maven skin:
http://andriusvelykis.github.io/reflow-maven-skin/

To generate maven site with markdown: http://stackoverflow.com/questions/14829190/how-to-use-markdown-for-maven-project-site

Implementation of the D* algorithm

Link: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.8257&rep=rep1&type=pdf

Complete javadoc documentation for hipster.algorithm.node.impl (core)

Complete javadoc documentation for hipster.algorithm (core)

IterativeSetCover does not fulfill the iterator contract

hasNext method is used to compute the next element. This can cause lots of problems. For instance, if there are 3 solutions, these lines will fail:

iterator.next(); // try to obtain first solution
iterator.next(); // try second solution
iterator.next(); // try with third one

Implement SMA*

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

Create README.md with markdown

Document the project using markdown. The documentation must include project goals, example usage, how to contribute, organization info, etc.

Complete javadoc documentation for hipster.util.maze (core)

Implementation of the breadth-first-search algorithm

Publish 1.0.0-rc1 artifacts to the central repository

Method search(SearchListener) from Algorithms does not stop

Implement IDA* algorithm

http://www.cis.temple.edu/~giorgio/cis587/readings/more-search.html#2

Complete javadoc documentation for hipster.util.parallel (core)

Complete javadoc documentation for hipster.algorithm.node (core)

Rename Algorithms class to Hipster

Fix A* cost comparator

Nodes are compared by g instead of f cost.

Complete javadoc documentation for hipster.collection

Complete javadoc documentation for hipster.algorithm.combinatorial (core)

Complete javadoc documentation for hipster.algorithm.impl (core)

Implement Tabu search

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

Creation of gh-pages for hipster static web content

Complete javadoc documentation for hipster.algorithm.factory (core)

Complete javadoc documentation for hipster.algorithm.node.adstar (core)

Move common algorithm code to abstract classes

Algorithms like Dijkstra, A* etc share lots of lines in common. Create abstract classes to extend basic behaviour and reuse same data structures and components.