Java 1.5+ generic API for search algorithms on graphs implicitly given by tree node expansion operator and edge transition cost function.
- pure java implementation using generics
- solve constraint-satisfaction problems
- iterative linear space tree traversals instead of recursive algorithms
- sample applications: Hamiltonian Path, Coin Change, Eight Queens, Egyptian Fractions
Be the first to post a review of Implicit Graph Search Library!