naman114 / graph-algorithm-visualizer Goto Github PK

Graph Algorithm Visualizer

A web app to visualize Breadth First Search, Depth First Search, Dijkstra's Algorithm and A* Search Algorithm on a grid

Try it out · Report Bug · Request Feature

A web application to visualize important graph algorithms like Breadth First Search, Depth First Search, Dijkstra's Algorithm and A* Search Algorithm on a 16x32 grid.

There is a source node and a destination node and and the user can add obstacles and place bombs on empty cells to make path finding harder for the algorithms to perform.

The motivation behind creating this project was to visualize and compare the behaviour and performance of different pathfinding graph algorithms in a dynamic and interactive manner.

Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.

If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

(back to top)

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

(back to top)

Naman Gogia - Linkedin - [email protected]
Ritik Arora - Linkedin - [email protected]

Hosted Website: https://graphalgorithms.netlify.app/
Project Link: https://github.com/naman114/Graph-Algorithm-Visualizer

(back to top)