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
386 stars 84 forks source link

add method to get a single shortest path #48

Closed fscottfoti closed 7 years ago

fscottfoti commented 8 years ago

the method has docstring here

https://github.com/UDST/pandana/compare/single-shortest-path?expand=1#diff-ae2236f48a67c962d74f4569610c199bR192

a nice extension of this would be to get a dataframe of shortest paths, in parallel

pksohn commented 7 years ago

Hey @fscottfoti, what's the status of this PR? It would be good to incorporate this feature if still valid (we'll just have to test for compatibility with newer features and Python 3).

fscottfoti commented 7 years ago

I think it worked in November of 2015. Very possibly still works ;)

coveralls commented 7 years ago

Coverage Status

Coverage increased (+0.6%) to 88.943% when pulling 66894a8bf11590c7cf8a72cf74a60e0aff909099 on single-shortest-path into 1785f80db5f0955b2019c35ffa95f40864fa9fa1 on master.

coveralls commented 7 years ago

Coverage Status

Coverage increased (+0.6%) to 88.943% when pulling 26af43a16f8d5d56668b80c4d8e6fdc903d1e223 on single-shortest-path into 1e47450dad0f189f3379fc7ba87d52f948f235c7 on master.

fscottfoti commented 7 years ago

I think it should work!