UGraph::EdgeIt Class Reference

#include <lemon/concepts/ugraph.h>

Inherits UGraph::Edge.

Inheritance diagram for UGraph::EdgeIt:

Inheritance graph
[legend]
List of all members.

Detailed Description

This iterator goes through each edge of a graph. Its usage is quite simple, for example you can count the number of edges in a graph g of type Graph as follows:
          int count=0;
          for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;


Public Member Functions

 EdgeIt ()
 Default constructor.
 EdgeIt (const EdgeIt &e)
 Copy constructor.
 EdgeIt (Invalid)
 Initialize the iterator to be invalid.
 EdgeIt (const UGraph &g)
 This constructor sets the iterator to the first edge.
 EdgeIt (const UGraph &, const Edge &)
 Edge -> EdgeIt conversion.
EdgeItoperator++ ()
 Assign the iterator to the next edge.


Constructor & Destructor Documentation

EdgeIt (  )  [inline]

Warning:
The default constructor sets the iterator to an undefined value.

EdgeIt ( const EdgeIt e  )  [inline]

Copy constructor.

EdgeIt ( Invalid   )  [inline]

Initialize the iterator to be invalid.

EdgeIt ( const UGraph g  )  [inline]

This constructor sets the iterator to the first edge of g.

Parameters:
g the graph

EdgeIt ( const UGraph ,
const Edge  
) [inline]

Sets the iterator to the value of the trivial iterator e. This feature necessitates that each time we iterate the edge-set, the iteration order is the same.


The documentation for this class was generated from the following file:
Generated on Tue Oct 31 09:51:50 2006 for LEMON by  doxygen 1.5.1