algorithmic modeling for Rhino



SpiderWeb is a .NET library providing functionality for preforming calculations on graphs. The library is created with a special focuse on the integration of graphs and graph related theroies (e.g. SpaceSyntax) in parametric design envoirnments. Therefore special Versions are avalible for:

DesignScript (planned)

Any feedback, questions or critic is welcomed.


General introduction into graph theory

Documentation and samples

.NET documentation for SpiderWebLibrary.dll and GH_SpiderWebLibrary.dll

Location: Vienna
Members: 256
Latest Activity: Sep 28, 2020

Discussion Forum

Measuring Location Density with Spider Web 1 Reply

Hi!I would like to know if there is a way to measure in Spider Web the…Continue

Started by Md01. Last reply by Richard Schaffranek Dec 7, 2018.

can someone show me the definition 5 Replies

can someone show me the definition    and i cant find any example of spiderweb,can someone…Continue

Started by wiku. Last reply by Ukendt Kunstner Nov 3, 2018.

Shortest Path through 3D Mesh 2 Replies

Hi!I've been trying to come up with a definition that will allow me to make one continous polyline of mesh edges to allow me to print it with a 3d extruder on a robotic arm.I haven't used spiderweb…Continue

Started by Louise Wotton. Last reply by Louise Wotton Dec 7, 2017.

shortest path angular component disappeared after 3.2 4 Replies

Hi ! i am very interesting in combine space syntax with grasshopper , and i have seen the 3.2 version spider had "shortest path angular" "shortest path"component to calculate the segment angular…Continue

Started by veaturn. Last reply by Richard Schaffranek May 17, 2017.

Comment Wall

Add a Comment

You need to be a member of SpiderWeb to add comments!

Comment by Richard Schaffranek on September 22, 2016 at 2:51


@2: Please define the longest Path, maybe it is possible with your specific definition. However please read:, especially the section about NP-complete...



Comment by Tomas Vinkevicius on September 22, 2016 at 2:41

Dear Richard,

Thank you for a quick reply.

Would it be possible to get a simple shortest path example between point A and point B as target?

Also is it possible to find longest path between node A and B?

Thank you,


Comment by Richard Schaffranek on September 22, 2016 at 2:38

Hello Tomas,

Have you had a look at:

besides this, I am sorry and currently I don't realy have the time to extend them. However if you have specific questions please post them in discussions, I will be able to help.



Comment by Tomas Vinkevicius on September 22, 2016 at 2:35


Is it possible to find spider web example files? The files found on mentioned website seems to be poorly documented. It would be good to have list of gh files as examples.

Comment by Md01 on August 3, 2016 at 9:55

Thank you richard,

This is really a great tool !

Comment by Richard Schaffranek on July 28, 2016 at 9:13

Well it's giving you back a graph which you can use again to compute the shortest path (smallest Distance) between each pair of nodes..

see attached file



Comment by Md01 on July 28, 2016 at 5:04

Hi Richard,

first thanks a lot for the great plugin!

One really small and (simple) question!

I know that the minimum spanning tree method is giving me the connection of all nodes with a minimum overall lentgh of the network.

But does it give me also the network that connects all the nodes + smallest distance between each nodes?


& Schöne Grüße von Rüdiger


Comment by Richard Schaffranek on November 28, 2015 at 13:56

Hi Mark,

will look into the definition. However if the costs are +Infinty this means that now path could be found....


Comment by Ortler Mark on November 28, 2015 at 12:54

Hey Ken
Hey Richard

I tried to solve the problem described below, using a loop (anemone) and SpiderWeb's ShortestPath...

I guess it should work, but there seems to be a bug in ShortestPath.
Have a look into the definition: u will see that the search finds a path with a cost of +Infinity at the second iteration. But there are quite a lot paths with lower cost...


Comment by Ken on October 10, 2015 at 9:00

Hello Richard,

Thank you very much for your reply!

In fact, what I want to know is all shortest path and not shortest but short paths. So it's neart to your second possibility, I think. But the difference is that I want to know all variation of paths from A to B within n-step, not calculate the number of paths.

For examaple, I decide start point in one grid of upper left. And I decide end points (not one point) like region as 2 grid of lower right. And I want to know  the variation of paths from A to B within 4steps.

So I think that my question is rahter BestFirstSearch than BredthFristSearch.

I copy the image in this mail.

Please give me some advice,


PS. I want to see the definition of your code in


but I can't download...

Can you check tha situation please?




Members (256)






  • Add Photos
  • View All

© 2021   Created by Scott Davidson.   Powered by

Badges  |  Report an Issue  |  Terms of Service