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.
This is the *minimum* complexity, because the underlying storage may
impose its own complexity costs on erasing the vertex itself as well.
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.
This is the *minimum* complexity, because the underlying storage may impose its own complexity costs on erasing the vertex itself as well.