Table of Contents
A web application that helps visualize how popular pathfinding algorithms such as A*, Dijkstra's, Breadth First Search, and Depth First Search attempt at finding the shortest path from the start to destination node.
Users also have the choice to either click and drag their left mouse key to create walls for the algorithms to go through, or click on the generate maze button to have the program generate one.
This is an example of how to list things you need to use the software and how to install them.
- npm
npm install npm@latest -g
- Clone the repo
git clone https://github.com/dannylu03/pathfinding-visualizer.git
- Install NPM packages
npm install
- To view locally, run in terminal
npm start
Try out the visualizer at: https://dannylu03.github.io/pathfinding-visualizer/
Alternatively, here are some gifs of the visualizer in action!
Distributed under the MIT License. See LICENSE
for more information.
Danny Lu - danny.lu075@gmail.com
Project Link: https://github.com/dannylu03/pathfinding-visualizer