Implementation of A Star algorithm to find the shortest path for ambulances. It's implementation is done in java Netbeans.
-
Updated
Apr 26, 2022
Implementation of A Star algorithm to find the shortest path for ambulances. It's implementation is done in java Netbeans.
This algorithmic project enables users to find the shortest path between two locations on a map. It leverages graph theory and A* search algorithm, providing a user-friendly solution similar to Google Maps. With comprehensive documentation and testing capabilities, it offers a reliable route planning solution.
π A* SEARCH ALGORITHM π Build a route-planning algorithm -like the one used in Google Maps- to calculate the shortest path between two points on a map π
Add a description, image, and links to the route-planning-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the route-planning-algorithm topic, visit your repo's landing page and select "manage topics."