forked from KeRNeLith/QuikGraph
-
Notifications
You must be signed in to change notification settings - Fork 0
Mutation Concepts
Alexandre Rabérin edited this page May 12, 2020
·
1 revision
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.