Version 5.0 The LEDA User Manual

Initialization of get queue() with all nodes of type OutAdjIt::nodetype that have zero
indegree, i.e. get(indeg,it)==indeg.value null.
while ( !algorithm.finished() ) {
// do something reasonable with algo.current()
algo.next();
}
The source code of function toposort count() is implemented according to this pattern
and may serve as a concrete example.
13.20 Strongly Connected Components (flexible) (
GIT SCC )
1. Definition
An instance algorithm of class GIT SCC < Out, In, It, OutSt, InSt, NSt, Mark > is an
implementation of an algorithm that computes the strongly connected components.
Iterator version: There is an iterator version of this algorithm: SCC It. Usage is similar
to that of node iterators without the ability to go backward in the sequence and only a
graph is allowed at creation time. Method compnumb() returns the component number of
the current node.
#include < LEDA/graph/graph iterator.h >
2. Creation
GIT SCC < Out, In, It, OutSt, InSt, NSt, Mark >
algorithm(OutSt ost, InSt ist, Mark ma, Out oai, const It& it, In iai);
Preconditions:
creates an instance algorithm of this class bound to the stack st
and data accessor ma.
• Out is an adjacency iterator that iterates over the outgoing edges of a fixed vertex
• In is an adjacency iterator that iterates over the incoming edges of a fixed vertex
• OutSt is stack parameterized with items of type Out
• InSt is stack parameterized with items of type In