Skip to content

pathfinding visualizer built using VanillaJS. Implemented Dijkstras, A*, BFS, DFS and Mazes

License

Notifications You must be signed in to change notification settings

Davisino/Pathfinding-Visualizer-2

Repository files navigation

Pathfinding Visualizer

About   |   Features   |   Technologies   |   Requirements   |   Starting   |   License   |   Author


About

The pathfinding visualizer project is aimed at helping people who are new into graph searching algorithms understand how they work. This project uses 5 different graph/trees search algorithms to find the distance between two points.

I chose this project because I wanted to learn more about data structures and specifically graph data structures. Since I started learning web development I have always dedicated part of my time to learn work on projects and learn new skills. Therefore I chose to do a "programming related" to learn twice as much by having to researching new programming related conceps and coding.

Features

Grid

Edit: Slow Motion

Technologies

The following tools were used in this project:

Requirements

Before starting 🏁, you need to have Git and Node installed.

Starting

# Clone this project
$ git clone https://github.com/Davisino/pathfindingvisualizer2

# Access
$ cd Pathfinding-Visuazlier-2022-

# Install dependencies
$ npm i

# Run the project
$ node index

# The server will initialize in the <http://localhost:3000>

License

This project is under license from MIT. For more details, see the LICENSE file.

Made with ❤️ by Davisino

 

About

pathfinding visualizer built using VanillaJS. Implemented Dijkstras, A*, BFS, DFS and Mazes

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published