Description
After being inspired by Clément Mihailescu's pathfinding algorithm visualizer, I set out to create my own. While my initial plan was to use React, I ultimately chose to work solely with JavaScript. This decision helped to deepened my understanding of JavaScript
During the development of this application, focus was placed on creating a functional yet clean and simple interface free from clutter.
Stack
These were the technologies used to build this application
JavaScript
HTML
CSS
Sass
Git
Features
Below are some of the features available within this application
Visualize
Vizualize algorithms to see how they attempt to find the shortest part around the obstacles you create. Some algorithms, such as Dijstra, also allows you to place weights in addition to the walls allowing for even more interesting interactions
Backtracking
After visualization, the algorithm performs an animation that displayed the shortest path from the start node to the end node. The start node can also be moved after the initial visualization and the shortest part animation will update to show the newest shortest path
Add Walls and Weights
Walls and weights can be added to the board to create different visualizations. Depending on the position of the start node, end node, walls and weights, each algorithm will generate different animations and create various shortest paths
Algorithms
Currently, there are three algorithms to choose from, Breadth First Search, Depth First Search and Dijkstra. Each algorithm findest the shortest path in varying ways which result in different visualizations