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:
Grasshopper
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
Website: http://www.gbl.tuwien.ac.at/Archiv/digital.html?name=SpiderWeb
Location: Vienna
Members: 257
Latest Activity: Jan 9
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 and i cant find any example of spiderweb,can someone…Continue
Started by wiku. Last reply by Ukendt Kunstner Nov 3, 2018.
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.
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.
Add a Comment
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,
Ken
PS. I want to see the definition of your code in
http://www.gbl.tuwien.ac.at/_docs/GrasshopperScriptum/lib/003_Zeit%...
and
http://www.gbl.tuwien.ac.at/_docs/GrasshopperScriptum/lib/003_Zeit%...
but I can't download...
Can you check tha situation please?
Ken
Hallo Ken,
the tool in question ist BreadthFristSearch not BestFirstSearch (which is something else). However what do you meen by "all" paths. "All shortest paths"? This can be done. Simply rightclick on the BreadthFirstSearch component and select all. This will output you "all shortest paths".
The second possiblity is to understand how many paths are there from A to B within n-steps. This can be simply done through matrix multiplication. Please have a look at: http://www.gbl.tuwien.ac.at/_docs/GrasshopperScriptum/lib/000_Theme...
However if you like to find "all paths leading from A to B where each edge can be used only once" you would need to write your own code since you would need to compute all possible paths. I guess this can be done for a 3*3 grid but if the grid gets larger you would need a lot of computer power + time. Please read this: https://en.wikipedia.org/wiki/Travelling_salesman_problem and/or this: https://en.wikipedia.org/wiki/NP-completeness
What is it you would like to archiev? Maybe the question was ill formulated?
Best
Richard
Hello Richard,
I want to do Bestfirstserch to find all path from one point to another.
For example, I'm trying to find all path of the grid 3×3, from the upper left to lower right. Can I solve this pronlem with spider web?
respected
Ken
Thanks a lot. It works~ I forgot to unlock these files.
Thanks for your helpful tools~
Have you done as described in:
http://www.gbl.tuwien.ac.at/_docs/GrasshopperScriptum/lib/002_Spide...
Hi, thanks for the useful tool. But I was wondering that SpiderWeb is compatible with Grasshopper 0.9.0076? Because the program does not appear on~
thanks alot
This shouldn't be a problem, The installer instruction is well ahead of the released Version.
These files will be included with the next releas which might take a while but will come with some new features for:
Spectral Graph Analysis and Clustering of n-dimensional Vectors...
and of course
Some bugfixes, above all solving the problem with the graphColoring tool
depending on what you do, could be distance if you don't need edge costs then just use an edge cost of 1 for each edge...
have a look at:
http://www.gbl.tuwien.ac.at/_docs/GrasshopperScriptum/lib/000_Theme...
Richard
Dear Richard,
thank you very much for the example provided.
Just one doubt about the "Edge costs of the graph"..want does it means?
Thanks in advance
Dario
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 1 Comment 0 Likes
© 2022 Created by Scott Davidson. Powered by
You need to be a member of SpiderWeb to add comments!