Skip to content

Python program to compute the shortest path between Indian state capitals using Single Source Shortest Path (SSSP) Algorithm. Fetched distance data from Google Maps, to find the optimal path.

Notifications You must be signed in to change notification settings

ManaliSBhavsar/Route-Optimization-Indian-Capitals

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

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)

About

Python program to compute the shortest path between Indian state capitals using Single Source Shortest Path (SSSP) Algorithm. Fetched distance data from Google Maps, to find the optimal path.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages