Version 5.0 The LEDA User Manual

OutAdjIt& −−it performs one step backward in the list of outgoing
edges of the marked node. If there is no predecesssor
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.6 Adjacency Iterators for incoming edges ( InAdjIt
)
1. Definition
a variable it of class InAdjIt is an adjacency iterator that marks a node (which is fixed
in contrast to linear node iterators) and iterates over the incoming edges of this node.
#include < LEDA/graph/graph iterator.h >
2. Creation
InAdjIt it;
introduces a variable it of this class associated with no graph.
InAdjIt it(const leda :: graph& G);
introduces a variable it of this class associated with G.
The node is initialized by G.first node( ) and the edge by
G.first in edge(n) where n is the marked node.
InAdjIt it(const leda :: graph& G, leda :: node n);
introduces a variable it of this class marked with n and associated
with G. The marked edge is initialized by G.first in edge(n).
Precondition: n is a node of G.
InAdjIt it(const leda :: graph& G, leda :: node n, leda :: edge e);
introduces a variable it of this class marked with n and e and associated
with G.
Precondition: n is a node and e an edge of G and target(e) = n.
3. Operations
void it.init(const leda :: graph& G)
associates it with G and marks it with n’ =
G.first node( ) and G.first adj edge(n’).