JSearch is a Java library with algorithms to find a path between two vertices of a graph. It provides classic search algorithms (depth-first,
breadth-first, A*, ...) which can be run on any problem that
implements the SearchProblemInterface
. PCP Solver is an example of an application.
Status: Usable but lacks documentation.
The source code is available on GitHub and is licensed under GPLv3.
- Java 6
- JUnit 3.8.1 for the unit tests
- Maven3 to build
- Clone repository
- Build with
mvn package
- Add the JAR you builded to your classpath.
- Extend
AbstractSearchProblem
and implement theSearchProblemInterface
. SeeGraph
for an example. - Call one of the predefined search algorithms. See
Example1
for an example.
Please report any bugs or suggestions via GitHub.
The following three Java graph libraries are Open Source Software.