Public Member Functions

Graph::NodeIt Class Reference


Detailed Description

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

#include <lemon/concepts/graph.h>

Inheritance diagram for Graph::NodeIt:

List of all members.

Public Member Functions

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

Constructor & Destructor Documentation

NodeIt ( ) [inline]
Warning:
The default constructor sets the iterator to an undefined value.
NodeIt ( const NodeIt n) [inline]

Copy constructor.

NodeIt ( Invalid  ) [inline]

Initialize the iterator to be invalid.

See also:
Invalid for more details.
NodeIt ( const Graph ) [inline]

Sets the iterator to the first node of g.

NodeIt ( const Graph ,
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 arc-set, the iteration order is the same.


Member Function Documentation

NodeIt& operator++ ( ) [inline]

Assign the iterator to the next node.

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines