A path finding visualiser built in python!
Explore the docs
View Demo
·
Report Bug
·
Request Feature
Table of Contents
I have built this path finding visualiser as part of Harvard's CS50 course. The visualiser is able to show a greedy algorithm, alongside breadth first search, depth first search, Djikstra's and A* search.
Just clone the repo and you're good to go!
This project requires two packages: pygame and numpy.
sh pip install numpy pygame
In order to use the visualiser, the user must run the runner.py file along with 2 optional command line arguments. The first of these is the algorithm keyword, which determines the algorith that is used to find the target. The second is the maze keyword, which automatically creates a maze on the board for the algorithm to explore. If both of these are omitted however, the algorithm will default to A* search and no maze will be drawn.
- Fix path drawing features
- Increase the number of algorithms visualised
See the open issues for a full list of proposed features (and known issues).
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!
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
Edwin Jaico-Berg - @ejaicoberg - e.j.berg@outlook.com
Project Link: https://github.com/EdwinJaico-Berg/final_project