Version 5.0 The LEDA User Manual

In addition to the algorithm mentioned earlier this wrapper writes the internal states to
the standard output.
This is as efficient as rewriting the “Algorithm”-class with an output mechanism, but
provides more flexibility.
13.2 Node Iterators ( NodeIt )
1. Definition
a variable it of class NodeIt is a linear node iterator that iterates over the node set of a
graph; the current node of an iterator object is said to be “marked” by this object.
#include < LEDA/graph/graph iterator.h >
2. Creation
NodeIt it;
introduces a variable it of this class associated with no graph.
NodeIt it(const leda :: graph& G);
introduces a variable it of this class associated with G.
The graph is initialized by G. The node is initialized by
G.first node( ).
NodeIt it(const leda :: graph& G, leda :: node n);
3. Operations
void it.init(const leda :: graph& G)
introduces a variable it of this class marked with n and associated
with G.
Precondition: n is a node of G.
associates it with G and marks it with G.first node( ).
void it.init(const leda :: graph& G, const leda :: node& v)
associates it with G and marks it with v.
void it.reset( ) resets it to G.first node( ), where G is the associated
graph.
void it.make invalid( ) makes it invalid, i.e. it.valid( ) will be false afterwards
and it marks no node.
void it.reset end( ) resets it to G.last node( ), where G is the associated
graph.