Advanced-Shortest-Path-Tracer

For project report click below!
Report »

Table of Contents

1. About The Project
2. Unique features
3. Contributing
4. Contact
5. Acknowledgments

About The Project

✓ Built a well-featured PyGame Visualizer to simulate the path tracing algorithm.
✓ Utilized & implemented an improved empirical algorithm (A* Algorithm) that outperforms the conventional Dijkstra’s approach by eliminating numerous inaccurate turns.

Unique features

➢ Unlike Dijkstra, the A* algorithm doesn’t search in all the possible directions.
➢ Instead, it is a directed algorithm and tries to go in the most appropriate direction.





➢ In example shown above, the algorithm knows the destination is at the back of the barrier.
➢ The algorithm always tries to go towards the right direction in each & every case.
➢ Thus, we are neglecting many misdirected paths, which may not lead us to the destination.
➢ A* algorithm is an empirical algorithm, which can be seen only in practice.

For high-resolution images, kindly refer to this Report.

(back to top)

Contributing

Contributions make the open-source community a fantastic place to learn, inspire, and create.
Any contributions made are greatly appreciated.

If any suggestions to improve this, please fork the repo and create a pull request.
Open an issue with the tag "enhancement".
Do not forget to give the project a star!
Thanks once again!

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

(back to top)

Contact

📫 Reach me:   LinkedIn   Email

Acknowledgments

Clément Mihailescu (Ex - Facebook, Ex - Google) is the primary inspiration for this project.
Special Thanks to Murarry for his constant support and guidance as and when needed.

(back to top)