NodeIt Class Reference


Detailed Description

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

Inheritance diagram for NodeIt:

Inheritance graph
[legend]

List of all members.

Public Member Functions

 NodeIt ()
 Default constructor.
 NodeIt (const NodeIt &n)
 NodeIt (Invalid)
 Invalid constructor & conversion.
 NodeIt (const Digraph &)
 Sets the iterator to the first node.
 NodeIt (const Digraph &, const Node &)
 Sets the iterator to the given node.
NodeItoperator++ ()
 Next node.


Constructor & Destructor Documentation

NodeIt (  )  [inline]

Default constructor.

Warning:
It sets the iterator to an undefined value.

NodeIt ( const NodeIt n  )  [inline]

Copy constructor.

NodeIt ( Invalid   )  [inline]

Initializes the iterator to be invalid.

See also:
Invalid for more details.

NodeIt ( const Digraph  )  [inline, explicit]

Sets the iterator to the first node of the given digraph.

NodeIt ( const Digraph ,
const Node  
) [inline]

Sets the iterator to the given node of the given digraph.


Member Function Documentation

NodeIt& operator++ (  )  [inline]

Assign the iterator to the next node.


doxygen