Path-Finder is a visualization tool that shows how path-finding algorithms work on a 2D grid.

Submitted by: Mykhailo Ivaniuk

This is interactive visualization tool. Implemented features are available to user:

• Choosing a starting place. To do that click on the empty board to set up start point, yellow square will appear indicating location of desired start
• Choosing ending place. To do that click on the grid one more time, blue square will appear indicating location of desired end
• Creating obstacles. Once user created start and end, they can make obstacles(black squares) by clicking on the grid.
• Starting visualization for A* algorithm. Press Space button to start visualization
• Starting visualization for Dijkstra's algorithm. Press button 'D' to start visualization
• Starting visualization for BFS algorithm. Press button 'B' to start visualization
• Erasing start point, end point and obstacles. In order to manually erase anything press with two fingers on your Mac touchpad(right click for Windows)
• Complete reset of the grid. To do so press 'C' on the keyboard
• Generating an obstacle map with predefined start and end positions. Press M on the keyboard and this map will appear.

Here's a walkthrough of some of the implemented features. The Algorithm that is shown on video walkthrough is A*

GIF created with LiceCap.

Here are some additional details:

1. Once visualization started, user cannot do anything until it finished.
2. Visualization colors for A* and Dijkstra's Algorithm are different
3. In order to start visualization user has to set start and end.