PathFindingAlgorithmsVisualizer

Interactive program to visualize path finding algorithms

Screenshot

How to use

1. Block any node in the grid by click on it using the left mouse button.
2. Press space to start select the start point and the destination point.
3. Now you have to choose the path finding algorithm.

• Press A for A*.
• Prees S for Dijkstra.
• Prees B for BFS.
• Press D for DFS.

You have to include the algs4.jar file to the project.

Drawing tool

All drawing done using algs4 library (included in the project files) from Princeton University algorithms course.