#include <lemon/list_graph.h>
It addition that it conforms to the ErasableGraph concept, it also provides several additional useful extra functionalities.
Definition at line 324 of file list_graph.h.
Public Member Functions | |
void | moveTarget (Edge e, Node n) |
Moves the target of e to n . | |
void | moveSource (Edge e, Node n) |
Moves the source of e to n . | |
void | reverseEdge (Edge e) |
Invert the direction of an edge. | |
void | reserveEdge (int n) |
Using this it possible to avoid the superfluous memory allocation. | |
void | contract (Node a, Node b, bool r=true) |
Contract two nodes. | |
Classes | |
class | SnapShot |
Class to make a snapshot of the graph and to restrore to it later. More... |
|
Moves the target of
Definition at line 334 of file list_graph.h. |
|
Moves the source of
Definition at line 342 of file list_graph.h. |
|
Definition at line 349 of file list_graph.h. |
|
Using this it possible to avoid the superfluous memory allocation.
Definition at line 359 of file list_graph.h. |
|
This function contracts two nodes.
Node
Definition at line 374 of file list_graph.h. |
Here is the call graph for this function: