🎯 Pathfinding Visualizer

Project - "Google Maps 0.5"

Team: Beeline Pioneers

Course Instructor : Prof. Clint P. George

In this project, we aim to showcase the how Google Maps work. It provides the best shortest route from a user specified source to destination. The blocks/walls/traffic can be set by the user or using functionalities added for making grids and arbitrary traffic.

Project files

1. main.py - has entire working of the project (main file)
2. node.py - has the class used for implementing nodes
3. button.py - has the class used for implementing buttons
4. Graphs.ipynb - has the Graphs used to compare different algo
5. priority_queue.py - has the class used for implementing prioriity_queue
6. algoCompare.csv - has the csv files containing the data to plot In this project, we aim to showcase the how Google Maps work.

Project Description

It provides the best shortest route from a user specified source to destination. The blocks/walls/traffic can be set by the user or using functionalities added for making grids and arbitrary traffic.The Project is programmed using Python3 and using pygame library.

Contributors

A big shoutout to the our team working hard on this project.

Work distribution

• Aniket: Algorithms, All Utility Functions

• Adarsh: Button Class, Pygame, Random Mazes, Exception Handling

• Rajat : Node class, Visualisations, Random Terrain, File I/O

📷 Screenshots

A* Algorithm -

Dijkstra Algorithm -

Acknowledgements

• Clement (Algoexpert)
• Tech with Tim (pygame)
• Google Maps developers

Appendix

• View the Slides here -> Slides

• View the executable file here -> Exe file

License

• MIT

Show some love ❤️ and Star ⭐️ the Repository to support the project.