https://github.com/manalisbhavsar/route-optimization-indian-capitals
Python program to compute the shortest path between Indian state capitals using Single Source Shortest Path (SSSP) Algorithm. Fetched distance data from Google Maps, structured it into a DataFrame, and implemented algorithms like Dijkstra’s to optimize travel routes efficiently.
https://github.com/manalisbhavsar/route-optimization-indian-capitals
data-structures-and-algorithms dijkstra-algorithm google-maps-api google-maps-python googlemaps python single-source-shortest-path
Last synced: 4 months ago
JSON representation
Python program to compute the shortest path between Indian state capitals using Single Source Shortest Path (SSSP) Algorithm. Fetched distance data from Google Maps, structured it into a DataFrame, and implemented algorithms like Dijkstra’s to optimize travel routes efficiently.
- Host: GitHub
- URL: https://github.com/manalisbhavsar/route-optimization-indian-capitals
- Owner: ManaliSBhavsar
- Created: 2019-08-12T23:47:54.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2025-02-17T07:54:54.000Z (4 months ago)
- Last Synced: 2025-02-17T08:33:08.531Z (4 months ago)
- Topics: data-structures-and-algorithms, dijkstra-algorithm, google-maps-api, google-maps-python, googlemaps, python, single-source-shortest-path
- Language: Python
- Homepage:
- Size: 14.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Python program to compute the shortest path between Indian state capitals
Uses Single Source Shortest Path (SSSP) Algorithm. Fetched distance data from Google Maps, structured it into a DataFrame, and implemented algorithms like Dijkstra’s to optimize travel routes efficiently.
Tech Stack:
Python (for implementing the algorithm and the overall logic)
Google Maps API (for fetching distance data)
Google Maps Python Client (for interacting with the API)
Dijkstra’s Algorithm (for shortest path calculation)
Data Structures (using arrays for graph representation and shortest path calculation)