Version 5.0 The LEDA User Manual

Note: There are specialized versions of STL wrapper iterator classes for each kind of
iterator that return different LEDA graph objects.
class name
NodeIt n
EdgeIt e
AdjIt n
AdjIt e
OutAdjIt n
OutAdjIt e
InAdjIt n
InAdjIt e
operator*() returns
node
edge
node
edge
node
edge
node
edge
#include < LEDA/graph/graph iterator.h >
2. Creation
STLNodeIt< DataAccessor, Iter > it(DataAccessor da, const Iter& base it);
3. Operations
introduces a variable it of this class bound to da and base it.
STLNodeIt& it = typename DataAccessor :: value type i
assigns the value i, i.e. set(DA, it, i) will be invoked
where DA is the associated data accessor and it the
associated iterator.
bool
bool
it == const STLNodeIt& it2
returns true if the associated values of it and it2 are
equal, i.e. get(DA, cit)==get(DA, cit2 ) is true where
cit is the associated iterator of it and cit2 is the associated
iterator of it2 and DA is the associated data
accessor.
it != const STLNodeIt& it2
returns false if the associated value equals the one
of the given iterator.
STLNodeIt& it.begin( )
resets the iterator to the beginning of the sequence.
STLNodeIt& it.last( )
resets the iterator to the ending of the sequence.
STLNodeIt& it.end( )
makes the iterators invalid, i.e. past-the-end-value.