Version 5.0 The LEDA User Manual

• Mark is a data accessor that has access to a boolean value that is associated with
each node of the graph
3. Operations
int algorithm.state( ) returns the internal state.
• NEXT OUT =first phase,
• NEXT ORDER =order phase,
• NEXT IN=second phase,
• NEXT DONE =algorithm finished
void algorithm.finish algo( )
executes the algorithm until finished( ) is true.
bool algorithm.finished( ) returns true if the algorithm is finished.
InSt& algorithm.get in stack( )
In algorithm.in current( )
OutSt& algorithm.get out stack( )
Out algorithm.out current( )
itnodetype algorithm.current node( )
int algorithm.compnumb( )
gives direct access to the internal stack of incoming
adjacency iterators.
returns the current iterator of the internal stack of
incoming adjacency iterators.
gives direct access to the internal stack of outgoing
adjacency iterators.
returns the current iterator of the internal stack of
outgoing adjacency iterators.
returns the current node.
returns the component number of the fixed node of
the current iterator if current state is NEXT IN.
int algorithm.next( ) Performs one iteration of the core loop of the algorithm.
4. Implementation
Each operation requires constant time. The algorithm has running time O(|V | + |E|).