	Name	Description
	Edges	Obtains a reference to the graph edges
	IsBiconnected	Determines whether this is a biconnected graph. A biconnected graph is a nonseparable graph, meaning if any vertex were to be removed, the graph will remain connected.
	IsConnected	Determines whether this is a connected graph (undirected graph) A graph is connected if there is an undirected path between each pair of vertices in it
	IsCyclic	Determines whether this is a cyclic digraph (directed graph)
	IsPlanar	Checks whether this graph is planar.
	IsStronglyConnected	Determines whether this is a strongly connected digraph (directed graph) A digraph is connected if there is a directed path between each pair of vertices in it.
	IsTree	Determines whether this graph is a tree (directed graph)
	Vertices	Obtains a reference to the graph vertices

	Name	Description
	AddEdge	Adds an edge to the graph
	AddVertex	Adds a vertex to the graph
	BreadthFirstTraversal	Performs a breath first traversal visiting of the graph parts in this graph, starting from the specified vertex
	ComputePlanarEmbedding	Computes 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.
	CreateBreadthFirstSpanningTree	Creates a breadth first spanning tree, by starting the traversal from the specified vertex
	CreateDepthFirstSpanningTree	Creates a depth first spanning tree, by starting the traversal from the specified vertex
	CreateTopoligicalOrderTree	Creates a topological order tree
	DepthFirstTraversal	Performs a depth first traversal visiting of the graph parts in this graph, starting from the specified vertex
	FindEdge	Finds the edge, which connects the specified vertices
	GetBiconnectedComponents	Returns the biconnected components of the graph, as well as the cut vertices.
	GetLongestPathLength	Returns the longest path length between 2 vertices.
	GetShortestPath	Returns the shortest path (if any) between the given vertices
	GetSTOrdering	Finds st-ordering of a biconnected graph.
	RemoveCycles	Removes the cycles in a cyclic directed graph by reversing some of the edges
	RemoveEdge	Removes the edge from the graph
	RemoveVertex	Removes the vertex from the graph
	RestoreVertexTags	Restores the vertices tags
	ReverseEdges	Reverses the specified list of edges
	SupplementToBiconnectedGraph	Supplements 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).
	ToAdjacencyList	Returns the adjacency list representation of the graph.
	TopologicalOrderTraversal	Performs a topological order traversal of the graph parts in this graph (directed graph)

	Name	Description
	Anr
	bnr

Reference