Closed wzm2256 closed 5 years ago
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. https://github.com/ThomasAFink/osmnx_adjacency_matrix_for_graph_convolutional_networks
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?