#include <lemon/smart_graph.h>
Public Member Functions | |
Edge | findEdge (Node u, Node v, Edge prev=INVALID) |
Finds an edge between 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... |
|
Finds an edge from node
If
u to v as it follows. for(Edge e=G.findEdge(u,v);e!=INVALID;e=G.findEdge(u,v,e)) { ... }
|
|
This function splits a node. First a new node is added to the graph, then the source of each outgoing edge of
|