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: 201
Latest Activity: Apr 5

Discussion Forum

Betweenness 7 Replies

HiI am quite new to graph theory and Spiderweb. I was wondering if there is a way for me to evaluate the betweenness of a graph.I created directly a dual graph from a series of spaces (no lines are…Continue

Started by Claudio Campanile. Last reply by Richard Schaffranek Jan 30.

4.1 example for shortest path 3 Replies


Started by machinehistories. Last reply by Nika Ishan Nov 25, 2016.

shortest path angular component disappeared after 3.2 3 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 veaturn Nov 2, 2016.

Get all vertices in each subgraph (for disjoint graph) 1 Reply

Hi,Could someone please help me with a subgraph problem.I have a datatree of integers where each path represents all the connections of the index of the path,…Continue

Tags: disjoint, sub-graph, theory, graph

Started by Sam Gregson. Last reply by Richard Schaffranek Nov 28, 2015.

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 6:52

If you take a closer look at the scriptum library there is an example there using BFS -> topologic shortest path in terms of space syntax

.NET documentation:

everything there is is what is under Documents section, no more no less sorry.

Again, brain dump...

If you are looking for a more complete library there is a python library for graphs but e.g. it misses spectral graph operations...

Comment by Tomas Vinkevicius on September 22, 2016 at 6:37

Thank you , I  see both representation of the graph and geometry within the components.

Would it be possible to get and example of shortest path in .NET?

Maybe you have a github where you share some of examples?

Comment by Richard Schaffranek on September 22, 2016 at 5:10

Don't understand, the display components are used in the example. they preview into rhino viewport. 

if you are asking for something like graph drawing you can use the eigensystem component to produce a somehow meaningfull drawing into rhino, please read:

Spiderweb is my personal brain dump so not everthing is there...

Comment by Tomas Vinkevicius on September 22, 2016 at 4:38

One more question, does the spider web has a "graph viewer" for representing graph without displaying actual geometry?

Just as in your website as nodes and edges in between?

Would it be possible to get an example for it two?

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 Maeva Kim 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




Members (201)



Search Grasshopper


  • Add Photos
  • View All

© 2017   Created by Scott Davidson.   Powered by

Badges  |  Report an Issue  |  Terms of Service