Skip to content

Finding the shortest cycling path between starting point and endpoint using OSMnx's graph_from_place()

Notifications You must be signed in to change notification settings

mkupisie/Finding-the-shortest-path-using-pandas-and-OSM

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 

Repository files navigation

Finding the shortest cycling path between starting point and endpoint

The code enables the user to find the shortest path between the entered starting point and endpoint. To read and retrieve routable networks for cycling in OpenStreetmap street network, OSMnx's graph_from_place() function is used. User must select first the area by providing area name, city and country. Place name must exist in the OpenStreetMap database (test can be run at openstreetmap.org or nominatim.openstreetmap.org).

After the entered area is found and returned, user can enter start point and end point. Based on the entered points program is finding the shortest path that is presented on interactive map with its length.

About

Finding the shortest cycling path between starting point and endpoint using OSMnx's graph_from_place()

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published