Version 5.0 The LEDA User Manual

void it.del( ) deletes the marked leaving edge, i.e. it.valid( ) returns
false afterwards.
Precondition: it.valid( ) returns true.
void it.reset end( ) resets it to G.last adj 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 leaving edge of n afterwards.
it marks n and e afterwards.
AdjIt&
bool
it = const AdjIt& it2
it == const AdjIt& it2
assigns it2 to it. 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.
bool it.eol( ) returns !it.valid( ) which is true if and only if there is
no successor edge left, i.e. if all edges of the edge set
are passed (eol: end of list).
bool it.valid( ) returns true if and only if end of sequence not yet
passed, i.e. if there is an edge in the edge set that was
not yet passed.
leda :: edge it.get edge( ) returns the marked edge or nil if it.valid( ) returns
false.
leda :: node it.get node( ) returns the marked node or nil if it.has node( ) returns
false.
const leda :: graph& it.get graph( )
returns the associated graph.
AdjIt it.curr adj( ) If the currently associated edge leaves the marked
node, this method returns a new adjacency iterator
that is associated with n’ = target(e) and
G.first adj edge(n’) where G is the associated graph.
Otherwise it returns a new adjacency iterator that is
associated with n’ = source(e) and G.first in edge(n’)
where G is the associated graph.
Precondition: it.valid( ) returns true.