-
Notifications
You must be signed in to change notification settings - Fork 391
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
How to calculate the road network distance? #8
Comments
Given the Road Network graph, we use the Dijkstra algorithm to find the shortest paths/distances for each node. |
tks:) |
How do you make the Road Network Graph for PEMS data? |
Here's an example for calculating the distances using OSMnx and Dijkstra. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hi, I have read your paper and really appreciate this algorithm, however, I still don't understand how did you calculate the road network distance between two vertex.
I am aware that the road network distance is not spatial distance, but I do not find any further detail in your paper.
Could you please explain how did you calculate the road network distance?
The text was updated successfully, but these errors were encountered: