ConArcIt< _Graph > Class Template Reference
[Basic Graph Utilities]


Detailed Description

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

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) {
        ...
      }

See also:
findArc()

ArcLookUp, AllArcLookUp, DynArcLookUp

#include <lemon/core.h>

List of all members.

Public Member Functions

 ConArcIt (const Graph &g, Node u, Node v)
 Constructor.
 ConArcIt (const Graph &g, Arc a)
 Constructor.
ConArcItoperator++ ()
 Increment operator.


Constructor & Destructor Documentation

ConArcIt ( const Graph &  g,
Node  u,
Node  v 
) [inline]

Construct a new ConArcIt iterating on the arcs that connects nodes u and v.

ConArcIt ( const Graph &  g,
Arc  a 
) [inline]

Construct a new ConArcIt that continues the iterating from arc a.


Member Function Documentation

ConArcIt& operator++ (  )  [inline]

It increments the iterator and gives back the next arc.


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

doxygen