ConEdgeIt Class Template Reference
[Basic Graph Utilities]

#include <lemon/core.h>

List of all members.


Detailed Description

template<typename _Graph>
class lemon::ConEdgeIt< _Graph >

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 Member Functions

 ConEdgeIt (const Graph &g, Node u, Node v)
 Constructor.
 ConEdgeIt (const Graph &g, Edge e)
 Constructor.
ConEdgeItoperator++ ()
 Increment operator.

Constructor & Destructor Documentation

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.


Member Function Documentation

ConEdgeIt& operator++ (  )  [inline]

It increments the iterator and gives back the next edge.


The documentation for this class was generated from the following file:

Generated on Tue May 5 07:41:40 2009 for LEMON by  doxygen 1.5.6