Inserts the edge (u,v) into the graph, and returns the new edge.

Adds a new vertex to the graph.

Gets a value indicating if the set of edges connected to v is empty

Returns a enumerable collection of adjacent vertices

Clears the graph.

Remove all edges to and from vertex u from the graph.

Gets a value indicating if there is an edge between the vertices u, v.

Returns the number of in-edges plus out-edges (for directed graphs) or the number of incident edges (for undirected graphs) of vertex v in graph g.

Returns the number of in-edges (for directed graphs) or the number of incident edges (for undirected graphs) of vertex v in graph g.

Enumerable collection of in-edges

Gets a value indicating if the set of in-edges is empty

Returns the out-degree edges of v

Returns an iterable collection of the out edges of v

Gets a value indicating if the set of out-edges is empty

Remove all the in-edges of vertex u for which the predicate pred returns true.

Remove all the out-edges of vertex u for which the predicate pred returns true.

Remove u from the vertex set of the graph. Note that undefined behavior may result if there are edges remaining in the graph who's target is u. Typically the ClearVertex function should be called first.

Parallel edge handling

Returns the vertex provider

Directed or undirected graph

Returns the vertex provider