SpiderWeb

261 members

Description

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:

Grasshopper
DesignScript (planned)

Any feedback, questions or critic is welcomed.

Documents

General introduction into graph theory

Documentation and samples

.NET documentation for SpiderWebLibrary.dll and GH_SpiderWebLibrary.dll

Comments Discussions Members

Betweenness

by Claudio Campanile

Jan 26, 2017

Hi

I 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 provided), so if I created a graph from cells I already have my dual graph (if I am no wrong). Also, from my understanding, betweenness implies the calculus of n^3 shortest path (where n is the number of nodes).

Thank you in advance.

Claudio

  • up

    Richard Schaffranek

    Hallo Claudio,

    1. Betweenness Measurment

    please find attached an example based on the betweenness formular given at: 

    https://en.wikipedia.org/wiki/Betweenness_centrality

    However I would like to point out that this might not be the betweenness formulated by SpaceSyntax so please double check, also SpiderWeb operates on directed graphs so this is also different to SpaceSyntax / depthmap but more general. 

    However this has some inpacts on results especialy when working on a grid.

    2. Graph generation

    If you create a graph from cells than you get a graph where every cell is represented by a vertex the edges show which cell is connected to which other cell....

    3. Computational Complexity

    Yes V^3 seams about right, as in this case DIJKSTRA is implemented with a complexity of V^2 (so not optimal as described here: https://de.wikipedia.org/wiki/Dijkstra-Algorithmus) and than you have to do it for every node.

    However why bother? Are you planning on running the city of London with SpiderWeb? Don't download Depthmap X. Depending on the Graphtype you use in SpiderWeb graphs are limited to around 65.000 vertices anyway. SpiderWeb is intendet for generative not for analytical purposes.

    Hope that helps.

    Richard

    6

    Jan 27, 2017

    Load Previous Replies