NevronOpenVision
Nevron.Nov.DataStructures Namespace / NGraph Class


In This Topic
    NGraph Class Methods
    In This Topic

    For a list of all members of this type, see NGraph members.

    Public Methods
     NameDescription
    Public MethodAdds an edge to the graph  
    Public MethodAdds a vertex to the graph  
    Public MethodPerforms a breath first traversal visiting of the graph parts in this graph, starting from the specified vertex  
    Public MethodComputes the planar emebedding of the graph if it is planar (i.e. fills the planarly ordered edge list of each vertex in anticlockwise direction) and returns true. Returns false if the graph is not planar.  
    Public MethodCreates a breadth first spanning tree, by starting the traversal from the specified vertex  
    Public MethodCreates a depth first spanning tree, by starting the traversal from the specified vertex  
    Public MethodCreates a topological order tree  
    Public MethodPerforms a depth first traversal visiting of the graph parts in this graph, starting from the specified vertex  
    Public MethodFinds the edge, which connects the specified vertices  
    Public MethodReturns the biconnected components of the graph, as well as the cut vertices.  
    Public MethodReturns the longest path length between 2 vertices.  
    Public MethodReturns the shortest path (if any) between the given vertices  
    Public MethodFinds st-ordering of a biconnected graph.  
    Public MethodRemoves the cycles in a cyclic directed graph by reversing some of the edges  
    Public MethodRemoves the edge from the graph  
    Public MethodRemoves the vertex from the graph  
    Public MethodRestores the vertices tags  
    Public MethodReverses the specified list of edges  
    Public MethodSupplements the current graph to a biconnected one by adding a new vertex and connecting it to each biconnected component (but not to a cut vertex in it).  
    Public MethodReturns the adjacency list representation of the graph.  
    Public MethodPerforms a topological order traversal of the graph parts in this graph (directed graph)  
    Top
    Protected Methods
     NameDescription
    Internal Method  
    Top
    See Also