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