Version 5.0 The LEDA User Manual

void it.update(leda :: node n)
it marks n afterwards.
void it.insert( ) creates a new node and it marks it afterwards.
void it.del( ) deletes the marked node, i.e. it.valid( ) returns false
afterwards.
Precondition: it.valid( ) returns true.
NodeIt&
bool
it = const NodeIt& it2
it == const NodeIt& it2
it is afterwards associated with the same graph and
node as it2 . This method returns a reference to it.
returns true if and only if it and it2 are equal, i.e. if
the marked nodes are equal.
leda :: node it.get node( ) returns the marked node or nil if it.valid( ) returns
false.
const leda :: graph& it.get graph( )
returns the associated graph.
bool it.valid( ) returns true if and only if end of sequence not yet
passed, i.e. if there is a node in the node set that was
not yet passed.
bool it.eol( ) returns !it.valid( ) which is true if and only if there is
no successor node left, i.e. if all nodes of the node set
are passed (eol: end of list).
NodeIt& ++it performs one step forward in the list of nodes of the associated
graph. If there is no successor node, it.eol( )
will be true afterwards. This method returns a reference
to it.
Precondition: it.valid( ) returns true.
NodeIt& −−it performs one step backward in the list of nodes of
the associated graph. If there is no predecessor node,
it.eol( ) will be true afterwards. This method returns
a reference to it.
Precondition: it.valid( ) returns true.
4. Implementation
Creation of an iterator and all methods take constant time.