-
Couldn't load subscription status.
- Fork 206
Mutation Concepts
Andrey Vernigora edited this page Feb 2, 2019
·
3 revisions
The mutation concepts define the different ways a graph can be modified. The hierarchy of mutation interface duplicates the traversal hierarchy and adds functionality to mutate the graph.
-
IMutableGraphdefines a graph that can be cleared, -
IMutableIncidenceGraphdefines methods to remove out-edges, -
IMutableVertexListGraphdefines methods to add and remove vertices, -
IMutableEdgeListGraphdefines methods to add and remove edges -
IMutableVertexAndEdgeListGraphmerges the two above concepts, -
IMutableBidirectionalGraphdefines method to remove out-edges