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

  • Documentation and examples

    Hello all.Do we have a link/backup or anything with documentation and examples on spiderweb?all links are downThank you in advance.Best Iason

    By Iason Giraud

    Feb 16, 2022

    0

  • Measuring Location Density with Spider Web

    Hi!I would like to know if there is a way to measure in Spider Web the connectivity of patches by using the Location Density. This is a measure in both spatial analysis and…

    By Md01

    Dec 7, 2018

    1

  • can someone show me the definition

    can someone show me the definition    and i cant find any example of spiderweb,can someone help me , thx 

    By wiku

    Oct 11, 2014

    5

  • Shortest Path through 3D Mesh

    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 before but I've had a look at a few of the example files, the longest line one in particular, and…

    By Louise Wotton

    Dec 6, 2017

    2

  • shortest path angular component disappeared after 3.2

    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 choice (in the space syntax). but in the lastest version 4.1 or 4.2,this conponet had…

    By veaturn

    Oct 30, 2016

    4

  • Betweenness

    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 provided), so if I created a graph from cells I already have my dual graph (if I am no wrong). Also,…

    By Claudio Campanile

    Jan 26, 2017

    7

  • 4.1 example for shortest path

     I am trying to use the shortest walk sample file but it won't work with the newest…

    By machinehistories

    Jul 17, 2015

    3

  • Get all vertices in each subgraph (for disjoint graph)

    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, e.g.{0}-3;4{1}-2{2}-1;3{3}-0;2;4{4}-0;3{5}-6;7{6}-5;7{7}-5;6Here it can be shown that there are two subgraphs containing 0,1,2,3,4 and…

    By Sam Gregson

    Nov 24, 2015

    1

  • 4.2 SpiderWeb

    SpiderWeb4.1->SpiderWeb4.2Grasshopper3d ComponentsAdded eigenDecomposition ComponentsAdded Clustering ComponentsAdded graphStyle ComponentsFixed Random Graph Coloring ErrorChanged a lot of Inputs and Outputs of Components.NET Library Changes- Class GH_graphStyle added to…

    By Richard Schaffranek

    Jul 20, 2015

    2

  • Hamiltonian Path

    I have been wondering how to discover closed Hamiltonian paths for a given set of edges. I came across EulerienPaths GraphTool in SpiderWeb and thought to ask here.Hamilton Path on a cube example:…

    By Anton Bakker

    Apr 13, 2015

    4