BpUGraph::IncEdgeIt Class Reference

#include <lemon/concepts/bpugraph.h>

Inherits BpUGraph::UEdge.

Inheritance diagram for BpUGraph::IncEdgeIt:

Inheritance graph
[legend]
List of all members.

Detailed Description

This iterator goes trough the incident undirected edges of a certain node of a graph. Its usage is quite simple, for example you can compute the degree (i.e. count the number of incident edges of a node n in graph g of type Graph as follows.
          int count=0;
          for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;


Public Member Functions

 IncEdgeIt ()
 Default constructor.
 IncEdgeIt (const IncEdgeIt &e)
 Copy constructor.
 IncEdgeIt (Invalid)
 Initialize the iterator to be invalid.
 IncEdgeIt (const BpUGraph &, const Node &)
 This constructor sets the iterator to first incident edge.
 IncEdgeIt (const BpUGraph &, const UEdge &)
 UEdge -> IncEdgeIt conversion.
IncEdgeItoperator++ ()
 Next incident edge.


Constructor & Destructor Documentation

IncEdgeIt (  )  [inline]

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

IncEdgeIt ( const IncEdgeIt e  )  [inline]

Copy constructor.

IncEdgeIt ( Invalid   )  [inline]

Initialize the iterator to be invalid.

IncEdgeIt ( const BpUGraph ,
const Node  
) [inline]

This constructor set the iterator to the first incident edge of the node.

IncEdgeIt ( const BpUGraph ,
const UEdge  
) [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

IncEdgeIt& operator++ (  )  [inline]

Assign the iterator to the next incident edge of the corresponding node.


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