ConEdgeIt

Declared in lemon/core.h, in the group Basic Graph Utilities; the same class on the Doxygen site.

template< typename GR >
class ConEdgeIt : public Edge

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:

for( ConEdgeIt< Graph > it( g , u , v ) ; it != INVALID ; ++it )
{
 ...
 }

See also

findEdge()

Public Types

typedef GR::Edge Edge
typedef GR::Node Node

Public Functions

inline ConEdgeIt( const GR & g , Node u , Node v )

Constructor.

Construct a new ConEdgeIt iterating on the edges that connects nodes u and v.

inline ConEdgeIt( const GR & g , Edge e )

Constructor.

Construct a new ConEdgeIt that continues iterating from edge e, on the edges that connect its two end nodes.

inline ConEdgeIt & operator++()

Increment operator.

It increments the iterator and gives back the next edge.