Version 5.0 The LEDA User Manual

#include < LEDA/graph/graph iterator.h >
2. Creation
FaceIt it;
introduces a variable it of this class associated with no graph.
FaceIt it(const leda :: graph& G);
introduces a variable it of this class associated with G.
The graph is initialized by G. The face is initialized by
G.first face( ).
FaceIt it(const leda :: graph& G, leda :: face n);
3. Operations
void it.init(const leda :: graph& G)
introduces a variable it of this class marked with n and associated
with G.
Precondition: n is a face of G.
associates it with G and marks it with G.first face( ).
void it.init(const leda :: graph& G, const leda :: face& v)
associates it with G and marks it with v.
void it.reset( ) resets it to G.first face( ), where G is the associated
graph.
void it.make invalid( ) makes it invalid, i.e. it.valid( ) will be false afterwards
and it marks no face.
void it.reset end( ) resets it to G.last face( ), where G is the associated
graph.
void it.update(leda :: face n)
FaceIt&
it = const FaceIt& it2
it marks n afterwards.
it is afterwards associated with the same graph and
face as it2 . This method returns a reference to it.
bool
it == const FaceIt& it2
returns true if and only if it and it2 are equal, i.e. if
the marked faces are equal.
leda :: face it.get face( ) returns the marked face or nil if it.valid( ) returns
false.
const leda :: graph& it.get graph( )
returns the associated graph.