4.1 example for shortest path

I am trying to use the shortest walk sample file but it won't work with the newest version of spiderweb. I am trying to replace the old components but I am having trouble understanding all of the input and output changes. You can see in the image above the differences between the components. It seems like some of the steps taken on previous versions are a bit different on this new version and it would be great to have a brief explanation on this. If it's possible I would love to get a sample of an upgraded shortest walk file using the new version of spiderweb to help understand how to get this working again.

Replies to This Discussion

Permalink Reply by Richard Schaffranek on July 19, 2015 at 13:12

Hallo,

So in the new Version G is always a Graph to preform the Algorithm on it. Here the mayor change happened to the previous version. The graph is now passed on as a GH_Param which speeds up the components. SP is the Starting Point.

As an output you will get C as a Datatree wich is equal to D. The output pG is equal to the output SPG also as one of the new Graph representation Parameter. It helps to input the Graphs in the graphDisplay Components to see the output.

For the second component EP are the Endpoints and W is a weight which is assigned to each edge / vertex along the journey. As outputs you will get the indexes of the Edges (gEi) used to travel from SP to EP and the weights (gEw). The same goes for the Vertices (gVi,gVw).

For more up to date examples please visit:

http://www.gbl.tuwien.ac.at/_docs/GrasshopperScriptum/GrasshopperSc...

Best Richard

Permalink Reply by machinehistories on July 19, 2015 at 18:17