Multiple paths between two points

Hello,

I’m working on a project and I want to generate different pedestrian paths between two points based on the distance, shade and/or points of interest in between.

I managed to get the shortest path using shortest walk component or Spiderweb. I would like to know if I can generate multiple paths between two points based on what happens in between.

I had a look at this interesting study, but unfortunately the link to the definition isn’t working.

I appreciate your advice.

Replies to This Discussion

Permalink Reply by Daniel González Abalde on March 30, 2017 at 4:25am

Maybe if you assign some attributes (distance, time of transit in vehicle, cultural interest value, etc.) at each step of the path (street piece), you can use some tree search based on the attribute you want to enhance in that path. This, if I am not mistaken, is graph theory.

I hope you know programming! It should be possible to do it in gh with some loop plugin, but my intuition tells me that it will be elegant zero if you want to automate an iterative search in a non-cyclical environment.

Permalink Reply by Anders Holden Deleuran on March 30, 2017 at 5:56am

That's correct, it is quite common to add numeric attributes to graph nodes which signify some real-world property (such as shade, interesting-ness etc.) and then calculate shortest walks within this graph which use one of these properties as the weight when calculating the cost of walking through the nodes (making it possible to make it more/less attractive to go through say the shaded area). If you're into Python I would recommend the networkx library (there are several threads related to how to implement it).

Permalink Reply by Hayder on March 31, 2017 at 11:50am