Compute weakly connected components of a directed graph.
In-parameter:A directed graph.
Types: Directed Graph
Out-parameter:A property map.
Remarks: Each vertex is mapped to a component id. If two vertices share the same id they are in the same component.
The running time is
O(n a(n, n)) where a is the inverse Ackermann function and thus almost linear. The union find data structure is used since the graph implementations do not allow the efficient iteration of in-edges.
SeqAn - Sequence Analysis Library - www.seqan.de