Version 5.0 The LEDA User Manual

3. dfs grow depth: a new adjacency iterator was appended to the stack because it
was detected as not seen before, i.e. the treewalk goes in depth-direction
4. dfs grow breadth: the former current adjacency iterator was replaced by the successor
iterator, i.e. the treewalk goes in breadth-direction
Iterator version: There is an iterator version of this algorithm: DFS It. Usage is similar
to that of node iterators without the ability to go backward in the sequence.
#include < LEDA/graph/graph iterator.h >
2. Creation
GIT DFS< OutAdjIt, Stacktype, Mark >
algorithm(const Stacktype& st, Mark& ma);
Preconditions:
creates an instance algorithm of this class bound to the stack st
and data accessor ma.
• Stacktype is a stack parameterized with items of type OutAdjIt.
• st contains the sources of the traversal (for each source node an adjacency iterator
referring to it) and
• ma is a data accessor that provides read and write access to a boolean value for
each node (accessed through iterators). This value is assumed to be freely usable
by algorithm.
GIT DFS< OutAdjIt, Stacktype, Mark >
algorithm(const Stacktype& st, Mark& ma, const OutAdjIt& ai);
creates an instance algorithm of this class bound to the stack st,
data accessor ma and the adjacency iterator ai representing the
source node of the depth first traversal.
3. Operations
void algorithm.next unseen( )
Performs one iteration of the core loop of the algorithm
for one unseen node of the graph.
dfs return algorithm.next( ) Performs one iteration of the core loop of the algorithm.
OutAdjIt algorithm.current( ) returns the “current” iterator.