Iterator for iterating on parallel edges connecting the same nodes. It is a higher level interface for the findEdge() function. You can use it the following way:
#include <lemon/core.h>
Inherits Edge.
| Public Member Functions | |
| ConEdgeIt (const GR &g, Node u, Node v) | |
| Constructor.  More... | |
| ConEdgeIt (const GR &g, Edge e) | |
| Constructor.  More... | |
| ConEdgeIt & | operator++ () | 
| Increment operator.  More... | |
| 
 | inline | 
Construct a new ConEdgeIt iterating on the edges that connects nodes u and v. 
| 
 | inline | 
Construct a new ConEdgeIt that continues iterating from edge e. 
| 
 | inline | 
It increments the iterator and gives back the next edge.
 1.8.5
 1.8.5