Finding.shortest.path.on.Google.Maps.using.Dijkstra.BFS.and.A_.algorithms.Adib.Probot.1.mp4
In the realm of navigation applications utilizing Google Maps, there exists a need to design and implement bespoke shortest path finder algorithms, steering clear of Google's proprietary closed-source methods. The primary objectives of this project are as follows:
Develop a solution that incorporates a minimum of three distinct shortest path finder algorithms. Facilitate a comprehensive real-time performance analysis to discern the strengths and weaknesses of each algorithm.
Devise algorithms that operate independently of Google's native closed-source routing mechanisms. Ensure a high degree of customization and adaptability to diverse real-world scenarios.
Implement a visually intuitive graphical user interface to depict the dynamic functioning of the algorithms on Google Maps. Enhance understanding of fundamental data structures and algorithms through real-time graphical representations.
To get started with this project, follow the instructions below.
- Java
- JavaFX
- Node.js
-
Clone the repository:
git clone https://github.com/thejediboySHASHANK/Message_Queue_Backend.git
Contact this repository's owner, if you want to run it yourself locally in your machine.
I have made a prototype of Gmaps navigation algorithm to emulate the navigation that happens in Gmaps and other related map navigation softwares. As, Google Maps is closed source, I have implemented BFS, Dijkstra’s and A* Algorithm to calculate the shortest path between two points, i.e Start and Destination Point.
Google Maps API is used only for Map demonstration purposes through extracting the intersection points from the Maps to calculate the shortest path.