Version 5.0 The LEDA User Manual

GIT BFS< OutAdjIt, Queuetype, Mark >
algorithm(const Queuetype& q, Mark& ma, const OutAdjIt& ai);
3. Operations
creates an instance algorithm of this class bound to the queue q,
data accessor ma and the adjacency iterator ai representing the
source node of the breadth first traversal.
void algorithm.next( ) Performs one iteration of the core loop of the algorithm.
OutAdjIt algorithm.current( ) returns the “current” iterator.
void algorithm.finish algo( )
executes the algorithm until finished( ) is true, i.e.
exactly if the Queue is empty.
bool algorithm.finished( ) returns true if the internal Queue is empty.
Queuetype& algorithm.get queue( )
4. Example
gives direct access to internal Queue.
This example shows how to implement an algorithmic iterator for breadth first search:
class BFS_It {
AdjIt
_source;
node_array _handler;
node_array_da _mark;
queue _q;
GIT_BFS _search;
public:
BFS_It(graph& G) :
_source(AdjIt(G)), _handler(G,false),
_mark(_handler), _search(_q,_mark)
{
_search.get_queue().clear();
_search.get_queue().append(_source);
}
bool valid() const { return !_search.finished(); }
node get_node() const { return _search.current().get_node(); }
BFS_It& operator++() {
_search.next(); return *this; }
};