BNodeIt Class Reference


Detailed Description

This iterator goes through each BNode. Its usage is quite simple, for example you can count the number of nodes in graph g of type Graph like this:
          int count=0;
          for (Graph::BNodeIt n(g); n!=INVALID; ++n) ++count;
#include <lemon/concepts/bpugraph.h>

Inheritance diagram for BNodeIt:

Inheritance graph
[legend]

List of all members.

Public Member Functions

 BNodeIt ()
 Default constructor.
 BNodeIt (const BNodeIt &n)
 BNodeIt (Invalid)
 Invalid constructor & conversion.
 BNodeIt (const BpUGraph &)
 Sets the iterator to the first node.
 BNodeIt (const BpUGraph &, const Node &)
 Node -> BNodeIt conversion.
BNodeItoperator++ ()
 Next node.


Constructor & Destructor Documentation

BNodeIt (  )  [inline]

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

BNodeIt ( const BNodeIt n  )  [inline]

Copy constructor.

BNodeIt ( Invalid   )  [inline]

Initialize the iterator to be invalid.

See also:
Invalid for more details.

BNodeIt ( const BpUGraph  )  [inline]

Sets the iterator to the first node of g.

BNodeIt ( const BpUGraph ,
const Node  
) [inline]

Sets the iterator to the node of the graph pointed by the trivial iterator. This feature necessitates that each time we iterate the edge-set, the iteration order is the same.


Member Function Documentation

BNodeIt& operator++ (  )  [inline]

Assign the iterator to the next node.


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