Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

UndirGraph::UndirEdgeIt Class Reference

#include <lemon/concept/undir_graph.h>

Inherits UndirGraph::UndirEdge.

Inheritance diagram for UndirGraph::UndirEdgeIt:

Inheritance graph
[legend]
List of all members.

Detailed Description

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


Public Member Functions

 UndirEdgeIt ()
 Default constructor.
 UndirEdgeIt (const UndirEdgeIt &e)
 Copy constructor.
 UndirEdgeIt (Invalid)
 Initialize the iterator to be invalid.
 UndirEdgeIt (const UndirGraph &)
 This constructor sets the iterator to the first undirected edge.
 UndirEdgeIt (const UndirGraph &, const UndirEdge &)
 UndirEdge -> UndirEdgeIt conversion.
UndirEdgeItoperator++ ()
 Assign the iterator to the next undirected edge.


Constructor & Destructor Documentation

UndirEdgeIt  )  [inline]
 

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

UndirEdgeIt const UndirEdgeIt e  )  [inline]
 

Copy constructor.

UndirEdgeIt Invalid   )  [inline]
 

Initialize the iterator to be invalid.

UndirEdgeIt const UndirGraph ,
const UndirEdge
[inline]
 

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


The documentation for this class was generated from the following file:
Generated on Sat Aug 27 14:17:11 2005 for LEMON by  doxygen 1.4.4