All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines
Public Member Functions
BpGraph::NodeIt Class Reference

Detailed Description

This iterator goes through each node of the graph. Its usage is quite simple, for example, you can count the number of nodes in a graph g of type BpGraph like this:

          int count=0;
          for (BpGraph::NodeIt n(g); n!=INVALID; ++n) ++count;

#include <lemon/concepts/bpgraph.h>

+ Inheritance diagram for BpGraph::NodeIt:

List of all members.

Public Member Functions

 NodeIt ()
 Default constructor.
 NodeIt (const NodeIt &n)
 NodeIt (Invalid)
 Invalid constructor & conversion.
 NodeIt (const BpGraph &)
 Sets the iterator to the first node.
 NodeIt (const BpGraph &, 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 BpGraph ) [inline, explicit]

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

NodeIt ( const BpGraph ,
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.

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines