Version 5.0 The LEDA User Manual

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
target(e) = n.
it marks e afterwards.
void it.reset( ) resets it to G.first in edge(n) where G and n are the
marked node and associated graph.
void
it.insert(const InAdjIt& other)
creates a new incoming 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 incoming edge, i.e. it.valid( ) returns
false afterwards.
Precondition: it.valid( ) returns true.
void it.reset end( ) resets it to G.last in edge(n) where G and n are the
marked node and associated graph.
void it.make invalid( ) makes it invalid, i.e. it.valid( ) will be false afterwards
and it marks no node.
void it.update(leda :: node n)
void it.update(leda :: node n, leda :: edge e)
it marks n and the first incoming edge of n afterwards.
it marks n and e afterwards.
InAdjIt&
bool
it = const InAdjIt& it2
it == const InAdjIt& it2
assigns it2 to it. This method returns a reference this
method returns a reference to it.
returns true if and only if it and it2 are equal, i.e. if
the marked nodes and edges are equal.
bool it.has node( ) returns true if and only if it marks a node.