If the queue is only modified by appending the iterator representing the source node onto the queue, a normal breadth first search beginning at the node of the graph is performed. It is possible to initialize the queue with several iterators that represent different roots of breadth first trees. By modifying the queue while running the algorithm the behaviour of the algorithm can be changed. After the algorithm performed a breadth first search, one may append another iterator onto the queue to restart the algorithm.
Usage is similar to that of node iterators without the ability to go backward in the sequence.
Queuetype is a queue parameterized with items of type OutAdjIt . This value is assumed to be freely usable by algorithm . Copyright 1998-2001, Algorithmic Solutions Software GmbH . All rights reserved.