Version 5.0 The LEDA User Manual

OutAdjIt
OutAdjIt
OutAdjIt
it(const leda :: graph& G);
introduces a variable it of this class associated with G.
The node is initialized by G.first node( ) and the edge by
G.first adj edge(n) where n is the marked node.
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 G.first adj edge(n).
Precondition: n is a node of G.
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 leda :: graph& G)
associates it with G and marks it with n’ =
G.first node( ) and G.first adj edge(n’).
void it.init(const leda :: graph& G, const leda :: node& n)
associates it with G and marks it with n and
G.first adj edge(n).
Precondition: n is a node of G.
void it.init(const leda :: graph& G, const leda :: node& n, const leda :: edge& 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 OutAdjIt& other)
creates a new leaving 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.
void it.del( ) deletes the marked leaving edge, i.e. it.valid( ) returns
false afterwards.
Precondition: it.valid( ) returns true.