public static bool IsErdoesGallai(global::Topologic.Graph graph, List <int> sequence) { return(graph.IsErdoesGallai(sequence)); }
public static List <global::Topologic.Vertex> IsolatedVertices(global::Topologic.Graph graph) { return(graph.IsolatedVertices); }
public static bool IsComplete(global::Topologic.Graph graph) { return(graph.IsComplete); }
public static int TopologicalDistance(global::Topologic.Graph graph, global::Topologic.Vertex startVertex, global::Topologic.Vertex endVertex) { return(graph.TopologicalDistance(startVertex, endVertex)); }
public static List <global::Topologic.Vertex> AdjacentVertices(global::Topologic.Graph graph, global::Topologic.Vertex vertex) { return(graph.AdjacentVertices(vertex)); }
public static bool ContainsEdge(global::Topologic.Graph graph, global::Topologic.Edge edge, double tolerance = 0.0001) { return(graph.ContainsEdge(edge, tolerance)); }
public static global::Topologic.Graph Connect(global::Topologic.Graph graph, global::Topologic.Vertex vertex1, global::Topologic.Vertex vertex2, double tolerance = 0.0001) { return(graph.Connect(vertex1, vertex2, tolerance)); }
public static List <global::Topologic.Vertex> VerticesAtCoordinates(global::Topologic.Graph graph, double x, double y, double z, double tolerance = 0.0001) { return(graph.VerticesAtCoordinates(x, y, z, tolerance)); }
public static global::Topologic.Graph RemoveVertices(global::Topologic.Graph graph, List <global::Topologic.Vertex> vertices) { return(graph.RemoveVertices(vertices)); }
public static global::Topologic.Graph RemoveEdges(global::Topologic.Graph graph, List <global::Topologic.Edge> edges) { return(graph.RemoveEdges(edges)); }
public static global::Topologic.Graph AddEdges(global::Topologic.Graph graph, List <global::Topologic.Edge> edges, double tolerance = 0.0001) { return(graph.AddEdges(edges, tolerance)); }
public static int Diameter(global::Topologic.Graph graph) { return(graph.Diameter); }
public static int MaximumDelta(global::Topologic.Graph graph) { return(graph.MaximumDelta); }
public static List <global::Topologic.Edge> Edges(global::Topologic.Graph graph, List <global::Topologic.Vertex> vertices, double tolerance = 0.0001) { return(graph.Edges(vertices, tolerance)); }
public static List <global::Topologic.Wire> AllPaths(global::Topologic.Graph graph, global::Topologic.Vertex startVertex, global::Topologic.Vertex endVertex, Nullable <int> timeLimitinSeconds) { return(graph.AllPaths(startVertex, endVertex, timeLimitinSeconds)); }
public static global::Topologic.Topology Topology(global::Topologic.Graph graph) { return(graph.Topology); }
public static global::Topologic.Wire Path(global::Topologic.Graph graph, global::Topologic.Vertex startVertex, global::Topologic.Vertex endVertex) { return(graph.Path(startVertex, endVertex)); }
public static int VertexDegree(global::Topologic.Graph graph, global::Topologic.Vertex vertex) { return(graph.VertexDegree(vertex)); }
public static global::Topologic.Wire ShortestPath(global::Topologic.Graph graph, global::Topologic.Vertex startVertex, global::Topologic.Vertex endVertex, String vertexKey, String edgeKey) { return(graph.ShortestPath(startVertex, endVertex, vertexKey, edgeKey)); }
public static bool ContainsVertex(global::Topologic.Graph graph, global::Topologic.Vertex vertex, double tolerance = 0.0001) { return(graph.ContainsVertex(vertex, tolerance)); }
public static List <global::Topologic.Wire> ShortestPaths(global::Topologic.Graph graph, global::Topologic.Vertex startVertex, global::Topologic.Vertex endVertex, String vertexKey, String edgeKey, Nullable <int> timeLimitinSeconds) { return(graph.ShortestPaths(startVertex, endVertex, vertexKey, edgeKey, timeLimitinSeconds)); }
public static List <int> DegreeSequence(global::Topologic.Graph graph) { return(graph.DegreeSequence); }
public static double Density(global::Topologic.Graph graph) { return(graph.Density); }