[Networkit] coarsening for ParallelConnectedComponents

Meyerhenke, Henning (ITI) meyerhenke at kit.edu
Tue Jul 18 17:13:09 CEST 2017



Am 18.07.17 um 16:53 schrieb Matteo Riondato:
> 
>> On Jul 18, 2017, at 10:49 AM, Henning Meyerhenke <henning.meyerhenke at kit.edu> wrote:
>>
>> If "coarsening" is set to true, after a few LP iterations, the graph is
>> contracted/coarsened in that clusters become supernodes. The component
>> search is then continued on the coarse graph recursively.
> 
> Thank you, Henning.
> 
> The above paragraph could probably be added to the C++ documentation of the ctor.

Yes, will do.

Thanks,
Henning



More information about the NetworKit mailing list