search

kuanb / peartree

peartree: A library for converting transit data into a directed graph for sketch network analysis.
MIT License
201 stars 23 forks source link

Traversing graph #174

Closed Dabendorf closed 3 years ago

Dabendorf commented 3 years ago

Hey, I am a bit missing a documentation for the project. Is there an easy way to traverse the graph or to get a list of all pairs of nodes and their shortest distances between each other?

Many greetings, Lukas

kuanb commented 3 years ago

Once the graph is initialized, it's a networkx object and you can use any/all methods available through that library. I would refer to that documentation for accomplishing tasks such as what you described:

https://networkx.org/