search

UDST / pandana

Pandas Network Analysis by UrbanSim: fast accessibility metrics and shortest paths, using contraction hierarchies :world_map:
http://udst.github.io/pandana
GNU Affero General Public License v3.0
385 stars 84 forks source link

Retrieving contracted nodes and edges of shortest paths #191

Closed arnolegendre closed 2 months ago

arnolegendre commented 2 months ago

Hello,

Many thanks for this implementation of contraction hierarchies and this super-fast routing tool.

Shortest path computation returns a list of nodes along the path; but i am also interested in all the intermediate edges in the original graph.

Is there any way to query the contracted nodes and edges, in order to recompose the full-shortest path ?

thanks again

arnolegendre commented 2 months ago

I realized that the missing edges i thought were from contractions, were due to the twoways parameter set to True at the graph creation. This setting added edges to the pandana graph, that were not existing in the original graph... and has nothing to do with contraction heiarchies.

This comment to explain myself about that. but i close the issue right now.