This Pathfinding Algorithm Visualizer does exactly what it sounds like it does - visualizes algorithms. This desktop application utilizes an unweighted and undirected grid as the graph that the algorithms will traverse. Click anywhere to place the start node, and click a second time to place the end node. After the start and end nodes have been placed, clicking will create a "wall" node (a node that is not traversable by the algorithms). Chose from the dropdown to select an algorithm, press start, and watch the magic happen. As the algorithm traverses the grid, open nodes are green, closed nodes are blue, and the shortest path nodes are purple. Clicking the "Show Heuristic" button will add the algorithm's heuristic to the visualization. If the algorithm has no heuristic - like BFS - it will not be shown. Finally, the application includes an 'Analytics' tab. After each run, this menu will be updated with the type of algorithm, nodes searched, and Nodes seen from the previous run.
- Python
- PyGame
- PyGame GUI
To get a local copy up and running follow these simple steps.
(These are Mac Commands, but the general steps still apply for Microsoft devices)
- Clone the repo
git clone https://github.com/HenryQuillin/pathfinding-algorithm-visualizer - Run setup.py
sudo python3 setup.py install - Wait for the build folder to appear
- Run 'main.py'
python3 main.py
A*
A*
Breadth First Search
Breadth First Search
Best First Search
Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.
- 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
Distributed under the MIT License. See LICENSE for more information.
Henry Quillin - Personal Website - Linkedin - [email protected]
Project Link: https://github.com/github_username/PONG-with-a-twist