A tuple with some names to help unpacking the result of an addEdge call.
Adds an edge to the graph.
Adds a new vertex to the graph.
Lists the outbound edges of a given vertex.
Removes an edge from the graph.
Removes a vertex from the graph. The complexity of this operaton varies with the storage class. For storage classes that have stable indexes, this is O(1). For classes with unstable indexes this is at least O(n), where n is the number of edges in the graph, due to the VertexDescriptors in all the edges having to be fixed up.
Fetches the descriptor of the source vertex of the given edge.
Fetches the descriptor of the target vertex of the supplied edge.
Fetches the total number of edges in the graph. For debugging purposes only.
Returns a forward range that yields the descriptors for each vertex in the graph. The order of the vertices is undefined.
A handle that can be used by callers to identify a given edge.