Defined in File ParallelConnectedComponents.hpp
public NetworKit::ComponentDecomposition
(Class ComponentDecomposition)
Determines the connected components of an undirected graph.
Public Functions
G – [in] Graph for which connected components shall be computed.
coarsening – [in] Specifies whether the main algorithm based on label propagation (LP) shall work recursively (true) or not (false) by coarsening/contracting an LP-computed clustering. Defaults to true since we saw positive effects in terms of running time for many networks. Beware of possible memory implications.
This method determines the connected components for the graph g.