InEdgeIt Class Reference


Detailed Description

This iterator goes trough the incoming edges of a certain node of a graph. Its usage is quite simple, for example you can count the number of outgoing edges of a node n in graph g of type Graph as follows.
          int count=0;
          for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
#include <lemon/concepts/bpugraph.h>

Inheritance diagram for InEdgeIt:

Inheritance graph
[legend]

List of all members.

Public Member Functions

 InEdgeIt ()
 Default constructor.
 InEdgeIt (const InEdgeIt &e)
 InEdgeIt (Invalid)
 InEdgeIt (const BpUGraph &g, const Node &n)
 This constructor sets the iterator to first incoming edge.
 InEdgeIt (const BpUGraph &, const Edge &)
 Edge -> InEdgeIt conversion.
InEdgeItoperator++ ()
 Next incoming edge.


Constructor & Destructor Documentation

InEdgeIt (  )  [inline]

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

InEdgeIt ( const InEdgeIt e  )  [inline]

Copy constructor.

InEdgeIt ( Invalid   )  [inline]

Initialize the iterator to be invalid.

InEdgeIt ( const BpUGraph g,
const Node n 
) [inline]

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

Parameters:
n the node
g the graph

InEdgeIt ( const BpUGraph ,
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

InEdgeIt& operator++ (  )  [inline]

Assign the iterator to the next inedge of the corresponding node.


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