EdgeIt Class Reference


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;
#include <lemon/concepts/graph.h>

Inheritance diagram for EdgeIt:

Inheritance graph
[legend]

List of all members.

Public Member Functions

 EdgeIt ()
 Default constructor.
 EdgeIt (const EdgeIt &e)
 EdgeIt (Invalid)
 EdgeIt (const Graph &g)
 This constructor sets the iterator to the first edge.
 EdgeIt (const Graph &, const Edge &)
 Edge -> EdgeIt conversion.
EdgeItoperator++ ()
 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 Graph g  )  [inline]

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

Parameters:
g the graph

EdgeIt ( const Graph ,
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.


Member Function Documentation

EdgeIt& operator++ (  )  [inline]

Assign the iterator to the next edge.


Generated on Thu Jun 4 04:06:46 2009 for LEMON by  doxygen 1.5.9