#include <lemon/list_graph.h>
It addition that it conforms to the ErasableGraph concept, it also provides several additional useful extra functionalities.
Public Member Functions | |
void | changeTarget (Edge e, Node n) |
Changes the target of e to n . | |
void | changeSource (Edge e, Node n) |
Changes 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. | |
Node | split (Node n, bool connect=true) |
Split a node. | |
Classes | |
class | SnapShot |
Class to make a snapshot of the graph and to restrore to it later. More... |
|
Changes the target of
|
|
Changes the source of
|
|
|
|
Using this it possible to avoid the superfluous memory allocation.
|
|
This function contracts two nodes.
Node
|
|
This function splits a node. First a new node is added to the graph, then the source of each outgoing edge of
|