SpiderWeb

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

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:

More complex breps (waterman shapes see GH file) , can they have a closed Hamilton path?

  • up

    Richard Schaffranek

    No such button. Please red the link to NP-Completness in Wikipedia.

    You can use the SpiderWeb script interface to program you own component.

    A way to solve the problem is e.g. through Galapagos. Please read:

    [PDF] von googlecode.comgooglecode.com [PDF]

    For some reason the file has a text extension and therefor you have to download it first and than rename it.

    best

    Richard