ConUEdgeIt Class Template Reference
[General Graph Utilities]

#include <lemon/graph_utils.h>

List of all members.


Detailed Description

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

Iterator for iterating on uedges connected the same nodes. It is higher level interface for the findUEdge() function. You can use it the following way:
      for (ConUEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) {
        ...
      }

Author:
Balazs Dezso


Public Member Functions

 ConUEdgeIt (const Graph &g, Node u, Node v)
 Constructor.
 ConUEdgeIt (const Graph &g, UEdge e)
 Constructor.
ConUEdgeItoperator++ ()
 Increment operator.


Constructor & Destructor Documentation

ConUEdgeIt const Graph &  g,
Node  u,
Node  v
[inline]
 

Construct a new ConUEdgeIt iterating on the edges which connects the u and v node.

ConUEdgeIt const Graph &  g,
UEdge  e
[inline]
 

Construct a new ConUEdgeIt which continues the iterating from the e edge.


Member Function Documentation

ConUEdgeIt& 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 Fri Feb 3 18:41:36 2006 for LEMON by  doxygen 1.4.6