#include <list_graph.h>
Inheritance diagram for SymListGraph:
addEdge(u,v)
adds a pair of oppositely directed edges. There is a new edge map type called SymEdgeMap that complements this feature by storing shared values for the edge pairs. The usual EdgeMap can be used as well.The oppositely directed edge can also be obtained easily using lemon::SymListGraph::opposite() "opposite()" member function.
Here erase(Edge) deletes a pair of edges.
Definition at line 442 of file list_graph.h.
Public Member Functions | |
Edge | addEdge (Node u, Node v) |
Adds a pair of oppositely directed edges to the graph. | |
void | erase (Edge e) |
Removes a pair of oppositely directed edges to the graph. | |
Static Public Member Functions | |
Edge | opposite (Edge e) |
The oppositely directed edge. |
|
Returns the oppositely directed pair of the edge |