BpUGraph::ANodeIt Class Reference

#include <lemon/concept/bpugraph.h>

Inherits BpUGraph::ANode.

Inheritance diagram for BpUGraph::ANodeIt:

Inheritance graph
[legend]
List of all members.

Detailed Description

This iterator goes through each ANode. 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::ANodeIt n(g); n!=INVALID; ++n) ++count;


Public Member Functions

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


Constructor & Destructor Documentation

ANodeIt  )  [inline]
 

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

ANodeIt const ANodeIt n  )  [inline]
 

Copy constructor.

ANodeIt Invalid   )  [inline]
 

Initialize the iterator to be invalid.

See also:
Invalid for more details.

ANodeIt const BpUGraph  )  [inline]
 

Sets the iterator to the first node of g.

ANodeIt 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

ANodeIt& operator++  )  [inline]
 

Assign the iterator to the next node.


The documentation for this class was generated from the following file:
Generated on Fri Feb 3 18:43:06 2006 for LEMON by  doxygen 1.4.6