Version 5.0 The LEDA User Manual

#include < LEDA/graph/graph iterator.h >
2. Creation
AdjIt it;
introduces a variable it of this class associated with no graph.
AdjIt it(const leda :: graph& G);
introduces a variable it of this class associated with G. The
marked node is initialized by n = G.first node( ) and the edge
by G.first adj edge(n).
AdjIt it(const leda :: graph& G, leda :: node n);
introduces a variable it of this class marked with n and associated
with G. The marked edge is initialized by by G.first adj edge(n).
Precondition: n is a node of G.
AdjIt it(const leda :: graph& G, leda :: node n, leda :: edge e);
introduces a variable it of this class marked with n and e and associated
with G.
Precondition: n is a node and e an edge of G and source(e) = n.
3. Operations
void it.init(const graphtype& G)
void it.init(const graphtype& G, const nodetype& n)
associates it with G and marks it with n’ =
G.first node( ) and G.first adj edge(n’).
associates it with G and marks it with n and
G.first adj edge(v).
Precondition: n is a node of G.
void it.init(const graphtype& G, const nodetype& n, const edgetype& e)
void it.update(leda :: edge e)
associates it with G and marks it with n and e.
Precondition: n is a node and e an edge of G and
source(e) = n.
it marks e afterwards.
void it.reset( ) resets it to G.first adj edge(n) where G and n are the
marked node and associated graph.
void
it.insert(const AdjIt& other)
creates a new edge from the marked node of it to the
marked node of other. it is marked with the new edge
afterwards. The marked node of it does not change.