OOP and DSA Project in HCMIU - Upgraded version of bomberman.
Solve any FreeCell Solitaire puzzle with 1 of the 4 different path finding algorithms: Breadth 1st Search, Depth 1st Search, Best 1st Search, Astar Search.
College project from Spring 2016 where I implemented a minimum weight spanning tree and shortest path finding algorithms at three levels of scale. I display the results graphically with animation as a map. All of this is implement in Java.
Add a description, image, and links to the path-finding-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the path-finding-algorithm topic, visit your repo's landing page and select "manage topics."