Version 5.0 The LEDA User Manual

void algorithm.finish algo( )
executes the algorithm until finished( ) is true, i.e.
exactly if the stack is empty.
bool algorithm.finished( ) returns true if the internal stack is empty.
void algorithm.init(OutAdjIt s)
Stacktype&
4. Implementation
initializes the internal stack with s.
algorithm.get stack( ) gives direct access to internal stack.
Each operation requires constant time.
O(m + n) time.
Therefore, a normal depth-first search needs
13.19 Topological Sort (flexible) ( GIT TOPOSORT
)
1. Definition
An instance algorithm of class GIT TOPOSORT< OutAdjIt, Indeg, Queuetype > is an
implementation of an algorithm that iterates over all nodes in some topological order, if
the underlying graph is acyclic. An object of this class maintains an internal queue, which
contains all nodes (in form of adjacency iterators where the current node is equal to the
fixed node) that are not yet passed, but all its predecessors have been passed.
Iterator version: There is an iterator version of this algorithm: TOPO 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. Additionally there is TOPO rev It which traverses
the graph in reversed topological order.
#include < LEDA/graph/graph iterator.h >
2. Creation
GIT TOPOSORT< OutAdjIt, Indeg, Queuetype >
algorithm(Indeg& indegree);
creates an instance algorithm of this class bound to indeg.
internal queue of adjacency iterators is empty.
The
Preconditions:
• Indeg is a data accessor that must provide both read and write access