This is the application where i implemented an A-star path finding algorithm, and made visualization for the process of finding the shortest path. I used C++ with SFML.
Here i will show features of this app.
This is main page that pops up on application start
There are three buttons. If map generator button is marked means that some tiles will be automatically put on the map randomly. When entered on the visualization stage, there is possibility of adding and removing obstacles, and changing start and end points on the map.
First type of mode of visualization is Static mode. This means that the algorithm will execute slowly so that you can see the process of finding shortest path.
Setting end and start points
Process of finding shortest path
Shortest path was found
There is also Dynamic mode, where you firstly set start and end points, and then the path will update as you add new obsticles
Start and end points set. The shortest path appeared
The path is updating with new obstacles adding
