Class ParallelLeiden

Inheritance Relationships

Base Type

Class Documentation

class ParallelLeiden : public NetworKit::CommunityDetectionAlgorithm

Public Functions

explicit ParallelLeiden(const Graph &graph, int iterations = 3, bool randomize = true, double gamma = 1)

Note

As reported by Sahu et. al in “GVE-Leiden: Fast Leiden Algorithm for Community

Detection in Shared Memory Setting”, the current implementation in

NetworKit might create a small fraction of disconnected communities. Since this violates the guarantees from the original algorithm, ParallelLeiden should be used with caution. In addition the modularity value of the resulting partition / clustering can be lower compared to other Leiden implementations and even Louvain.

Parameters:
  • graph – A networkit graph

  • iterations – Number of Leiden Iterations to be run

  • randomize – Randomize node order?

  • gamma – Resolution parameter

virtual void run() override

Apply algorithm to graph

Public Members

int VECTOR_OVERSIZE = 10000