All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages

Community

Various community detection and graph clustering algorithms. More...

## Namespaces | |

NetworKit::GraphClusteringTools | |

## Classes | |

class | NetworKit::ClusteringGenerator |

Provides several methods for generating special clusterings. More... | |

class | NetworKit::CommunityDetectionAlgorithm |

Abstract base class for community detection/graph clustering algorithms. More... | |

class | NetworKit::Conductance |

Compute conductance of a 2-partition, i.e. More... | |

class | NetworKit::Coverage |

Coverage is the fraction of intra-cluster edges. More... | |

class | NetworKit::DissimilarityMeasure |

Base class for all clustering dissimilarity measures. More... | |

class | NetworKit::DynamicNMIDistance |

class | NetworKit::EdgeCut |

class | NetworKit::GraphStructuralRandMeasure |

The graph-structural Rand measure assigns a similarity value in [0,1] to two partitions of a graph, by considering connected pairs of nodes. More... | |

class | NetworKit::JaccardMeasure |

class | NetworKit::LPDegreeOrdered |

Label propagation-based community detection algorithm which processes nodes in increasing order of node degree. More... | |

class | NetworKit::Modularity |

Modularity is a quality index for community detection. More... | |

class | NetworKit::NMIDistance |

NMIDistance quantifies the dissimilarity between two clusterings using Normalized Mutual Information. More... | |

class | NetworKit::NodeStructuralRandMeasure |

The node-structural Rand measure assigns a similarity value in [0,1] to two partitions of a graph, by considering all pairs of nodes. More... | |

class | NetworKit::ParallelAgglomerativeClusterer |

A parallel agglomerative community detection algorithm, maximizing modularity. More... | |

class | NetworKit::PLM |

Parallel Louvain Method - a multi-level modularity maximizer. More... | |

class | NetworKit::PLP |

As described in Ovelgoenne et al: An Ensemble Learning Strategy for Graph Clustering Raghavan et al. More... | |

class | NetworKit::QualityMeasure |

Abstract base class for all clustering quality measures. More... | |

class | NetworKit::SampledGraphStructuralRandMeasure |

The graph-structural Rand measure assigns a similarity value in [0,1] to two partitions of a graph, by considering connected pairs of nodes. More... | |

class | NetworKit::SampledNodeStructuralRandMeasure |

The node-structural Rand measure assigns a similarity value in [0,1] to two partitions of a graph, by considering pairs of nodes. More... | |

Various community detection and graph clustering algorithms.