A visualizer for pathfinding algorithms! This repository contains two versions of the visualizer:
- Web Version: A modern, interactive web-based visualizer built with HTML, CSS, and JavaScript.
- Python Version: The original version built with Python and Pygame.
The new Web Version provides a sleek, responsive, and interactive experience directly in your browser.
- Visualization of various pathfinding algorithms
- Interactive grid: draw walls, move start/end nodes
- Control over animation speed
- Clean, responsive design
Simply open the hosted GitHub Pages link, or clone the repository and open index.html in your favorite web browser!
The original Python version provides a visual implementation of A* and Dijkstra's algorithms using Pygame on a 50x50 grid. You can find the source code in the PythonVersion/ directory.
To run this script, you'll need Python and Pygame. You can install Pygame via pip:
pip install pygameNavigate to the PythonVersion folder and run the script:
cd PythonVersion
python PathfindingVisualizer.py- Left Mouse Click: Set the start point, end point, and draw obstacles.
- Right Mouse Click: Remove nodes or obstacles.
- Spacebar: Start the algorithm.
- C: Clear the grid.
- A: A* Pathfinding Algorithm
- B: Dijkstras Pathfinding Algorithm
