NxM puzzle solver using graph traversal algorithms
-
Updated
Jun 4, 2021 - Java
NxM puzzle solver using graph traversal algorithms
Java graph traversal and path finding algorithms library. Implements Iterative deepening A* (IDA*)
Implementation of UCS and IDA* algorithms, using them to calculate paths in a city based on traffic predictions.
Add a description, image, and links to the ida-star topic page so that developers can more easily learn about it.
To associate your repository with the ida-star topic, visit your repo's landing page and select "manage topics."