If the stack is only modified by pushing the iterator representing the source node onto the stack, a normal depth first search beginning at the node of the graph is performed. It is possible to initialize the stack with several iterators that represent different roots of depth first trees. By modifying the stack while running the algorithm the behaviour of the algorithm can be changed. After the algorithm performed a depth first search, one may push another iterator onto the stack to restart the algorithm. A next step may return a state which describes the last action.
Usage is similar to that of node iterators without the ability to go backward in the sequence.
Stacktype is a stack parameterized with items of type OutAdjIt . This value is assumed to be freely usable by algorithm . Performs one iteration of the core loop of the algorithm for one unseen node of the graph. Performs one iteration of the core loop of the algorithm. Each operation requires constant time.