### SpiderWebBasic

DataTreeToGraph parse a DataTree | |

Dual Graph Dual Graph | |

graphFromCells Create a Graph From a Set of Ajoining Cells | |

graphFromLines create a graph from a set of connected lines | |

graphFromMesh Create a directed Graph From a Mesh | |

graphFromPoints Create a Graph From a Set of Points and a Connection Distance | |

GraphToDataTree convert a Graph to a DataTree | |

visualGraphGrid Create a visualGraphGrid from obstacles and a boundary area |

### SpiderWebTools

EulerianPath Checks if the Given Graph Has an Eulerian Path and Eeturns All Possible Starting Points | |

Breadth-first Search Breadth-first Search | |

MinST Mininmal Spanning Tree | |

ShortestPathBetweenPoints Callculates the shortest path between points | |

randomized Sequential Graph Coloring Randomized Sequential Graph Coloring | |

recursiveShadowCasting preformes recursive shadow casting on a visualGraph | |

Single Source Shortest Path Solves the Single Source Shortest Path Problem |

### SpiderWebDisplay

Display Graph Display Graph | |

Display graphEdge Display graphEdge | |

Display graphVertex Display graphVertex | |

Display visualGraph Display visualGraph | |

Graph Style Greate New Style for Displaying a Graph |

### SpiderWeb

graphEdgeList Graph represented as list of edges. | |

graphMatrix graph Matrix representation | |

graphStyle Style to Represent a Graph | |

graphVertexList Graph represented as list of vertices. | |

visualGraph visualGraph represented as list of vertices. |

### SpiderWebManipulation

find Edges get the index of a graphEdge within a Graph | |

manipulateEdges Merge, Delete, Insert Edges | |

manipulateVertices Merge, Delete Insert Vertices | |

Split Split a graph at a given Distance |

### SpiderWebFilter

Image-GraphFilter Iamge based Filters on Graphs | |

Points of Interest Points of Interest |

### SpiderWebClustering

agglomerativeClustering Preforms a bottom up distance clustering. | |

distanceClustering Preforms a top down distance clustering. |

### SpiderWebSpectral

Eigensystem Computes the Eigensystem of graphMatrix | |

SpectralMatching computes n-dimensional vectors for spectralGraphMatching |