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.
As a user, I would like an implementation of the Depth Limited Search algorithm such that I can perform searches similar to Depth First Search without having to worry about problems such as non-termination.
As a user, I would like an implementation of the Depth Limited Search algorithm such that I can perform searches similar to Depth First Search without having to worry about problems such as non-termination.
Link: https://en.wikipedia.org/wiki/Depth-limited_search