Iterator for iterating on parallel arcs connecting the same nodes. It is a higher level interface for the findArc() function. You can use it the following way:
for (ConArcIt<Graph> it(g, src, trg); it != INVALID; ++it) { ... }
#include <lemon/core.h>
Public Member Functions | |
| ConArcIt (const GR &g, Node u, Node v) | |
| Constructor. | |
| ConArcIt (const GR &g, Arc a) | |
| Constructor. | |
| ConArcIt & | operator++ () |
| Increment operator. | |
| ConArcIt | ( | const GR & | g, |
| Node | u, | ||
| Node | v | ||
| ) | [inline] |
Construct a new ConArcIt iterating on the arcs that connects nodes u and v.
| ConArcIt | ( | const GR & | g, |
| Arc | a | ||
| ) | [inline] |
Construct a new ConArcIt that continues the iterating from arc a.
| ConArcIt& operator++ | ( | ) | [inline] |
It increments the iterator and gives back the next arc.
1.7.3