Timeline for Obtaining List of Coordinates for Route Along Nearest Edge Using OSMnx, Python and Leaflet
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 13 at 5:12 | comment | added | Jorge Emilio Peña | @gboeing Apologies in advance, I added a link to a file in my repository. I have tried reducing the code as much as possible. This is also my first time sharing code or asking a question, so it might be very noisy code. If you have any questions or comments, please let me know. Any type of feedback will be very appreciated. | |
| Feb 13 at 5:07 | history | edited | Jorge Emilio Peña | CC BY-SA 4.0 |
Add link to simplified code
|
| Feb 11 at 18:18 | comment | added | gboeing | Also note that OSMnx builds graph models of the street network. A graph is a set of nodes linked to each other by a set of edges. There is no concept of a path along a graph starting in the middle of an edge: by definition, paths are between nodes. Thus, any such project would require some ad hoc geospatial work, as you noted. | |
| Feb 11 at 18:05 | comment | added | gboeing | Please provide a complete, minimal, reproducible code snippet for us to reproduce and troubleshoot. | |
| S Feb 11 at 4:05 | review | First questions | |||
| Feb 11 at 14:09 | |||||
| S Feb 11 at 4:05 | history | asked | Jorge Emilio Peña | CC BY-SA 4.0 | created from wizard |