#include <lemon/graph_utils.h>
for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { ... }
Public Member Functions | |
ConEdgeIt (const Graph &g, Node u, Node v) | |
Constructor. | |
ConEdgeIt (const Graph &g, Edge e) | |
Constructor. | |
ConEdgeIt & | operator++ () |
Increment operator. |
|
Construct a new ConEdgeIt iterating on the edges which connects the |
|
Construct a new ConEdgeIt which continues the iterating from the |
|
It increments the iterator and gives back the next edge. |