- A GUI interface that visualizes various pathfinding algorithms on a real-time map of Bangalore city.
- It allows users to see how algorithms like BFS, DFS, Bellman-Ford, Dijkstra, and A-Star find paths across a real-world map.
- Star ⭐ this repo
- Fork this repo
- Add your file inside the appropriate folder
- Commit your changes
- Open a Pull Request
- Pathfinding Algorithms: Implementations of BFS, DFS, Bellman-Ford, Dijkstra, and A-Star.
- Interactive Map: Real-time rendering of the map and paths.
- Vehicle Movement: Simulated movement along the computed path.
- Comparison Mode: Compare different paths and their statistics (distance and time).
- Visual Elements: Roads, buildings, and natural elements are clearly marked.
- Clone this repository:
git clone https://github.com/R-Anurag/Pathfinding-Visualizer.git - Install dependencies:
pip install -r requirements.txt - Run the visualizer:
python main.py
| Key | Action |
|---|---|
| C | Enable Compare Paths mode — lets you cycle through and compare different algorithms’ paths. |
| ↑ (Up Arrow) | Cycle backward through available algorithms in Compare Paths mode. |
| ↓ (Down Arrow) | Cycle forward through available algorithms in Compare Paths mode. |
- Select the pathfinding algorithm you want to use from the menu.
- Click on the map to set the start and end points (red and green location markers).
- Watch as the algorithm finds the shortest path on the map.
- Press C on the keyboard to compare the performance(time & distance) of different algorithms in real-time
Feeling inspired? Contribute to the project! Report bugs, suggest new features, or improve the existing code.
This project is licensed under the MIT License. Feel free to use and share responsibly.