Version 5.0 The LEDA User Manual

EdgeIt&
bool
it = const EdgeIt& it2
it == const EdgeIt& 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 edges are equal.
bool it.eol( ) returns !it.valid( ) which is true if and only if there
is no successor edge left, i.e. if all edges leaving the
marked node 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 leaving the marked
node that was not yet passed.
leda :: edge it.get edge( ) returns the marked edge or nil if it.valid( ) returns
false.
const leda :: graph& it.get graph( )
returns the associated graph.
EdgeIt& ++it performs one step forward in the list of edges of the associated
graph. If there is no successor edge, it.eol( )
will be true afterwards. This method returns a reference
to it.
Precondition: it.valid( ) returns true.
EdgeIt& −−it performs one step backward in the list of edges of
the associated graph. If there is no predecessor edge,
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.
13.4 Face Iterators ( FaceIt )
1. Definition
a variable it of class FaceIt is a linear face iterator that iterates over the face set of a
graph; the current face of an iterator object is said to be “marked” by this object.
Precondition: Before using any face iterator the list of faces has to be computed by
calling G.compute faces( ). Note, that any update operation invalidates this list.