Pathfinding Visualizer

Table of Contents

1. About The Project
   • Built With
2. Getting Started
   • Prerequisites
   • Installation
3. Usage
4. Contact

About The Project

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.

Built With

• React JS
• HTML/CSS

Getting Started

Prerequisites

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

Installation

1. Clone the repo

   git clone https://github.com/dannylu03/pathfinding-visualizer.git

2. Install NPM packages

   npm install

3. To view locally, run in terminal

   npm start

Usage

Try out the visualizer at: https://dannylu03.github.io/pathfinding-visualizer/

Alternatively, here are some gifs of the visualizer in action!

License

Distributed under the MIT License. See LICENSE for more information.

Contact

Danny Lu - danny.lu075@gmail.com

Project Link: https://github.com/dannylu03/pathfinding-visualizer