SpiderWeb

Add a Comment

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

@1: simpleShortestPath.gh

@2: Please define the longest Path, maybe it is possible with your specific definition. However please read: https://en.wikipedia.org/wiki/Hamiltonian_path, especially the section about NP-complete...

Best

Richard

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,

Tomas 

Comment by Richard Schaffranek on September 22, 2016 at 2:38

Hello Tomas,

Have you had a look at:

http://www.gbl.tuwien.ac.at/_docs/GrasshopperScriptum/GrasshopperSc...

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.

Best

Richard

Comment by Tomas Vinkevicius on September 22, 2016 at 2:35

Hi,

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 Md01 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

Best

Richard

minSPANNINGTREE.gh

Comment by Md01 on July 28, 2016 at 5:04

Hi Richard,

first thanks a lot for the great plugin!

One really small and (simple) question!

I know that the minimum spanning tree method is giving me the connection of all nodes with a minimum overall lentgh of the network.

But does it give me also the network that connects all the nodes + smallest distance between each nodes?

Danke!

& Schöne Grüße von Rüdiger

Maeva

Comment by Richard Schaffranek on November 28, 2015 at 13:56

Hi Mark,

will look into the definition. However if the costs are +Infinty this means that now path could be found....

Richard

Comment by Ortler Mark on November 28, 2015 at 12:54

Hey Ken
Hey Richard

I tried to solve the problem described below, using a loop (anemone) and SpiderWeb's ShortestPath...

AllShortestPaths.gh

I guess it should work, but there seems to be a bug in ShortestPath.
Have a look into the definition: u will see that the search finds a path with a cost of +Infinity at the second iteration. But there are quite a lot paths with lower cost...

Greets
Mark

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