SpiderWeb

Add a Comment

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,

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

1008.JPG

Comment by Richard Schaffranek on October 9, 2015 at 6:01

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

Comment by Ken on October 9, 2015 at 3:42

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

Comment by lichih ho on April 12, 2015 at 20:49

Thanks a lot. It works~ I forgot to unlock these files.

Thanks for your helpful tools~

Comment by Richard Schaffranek on April 12, 2015 at 13:36

Have you done as described in:

http://www.gbl.tuwien.ac.at/_docs/GrasshopperScriptum/lib/002_Spide...

Comment by lichih ho on April 12, 2015 at 9:31

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~

Comment by ahmad heidari on January 7, 2015 at 2:15

thanks alot

Comment by Richard Schaffranek on January 4, 2015 at 6:12

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

Comment by Richard Schaffranek on December 15, 2014 at 9:52

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

Comment by Dario on December 15, 2014 at 9:22

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

• ‹ Previous
• 1
• 2
• 3
• 4
• 5
• …
• 9
• Next ›
• Page