All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
LocalPartitionCoverage.h
Go to the documentation of this file.
1 #ifndef LOCALPARTITIONCOVERAGE_H
2 #define LOCALPARTITIONCOVERAGE_H
3 
4 
5 #include "Centrality.h"
6 #include "../structures/Partition.h"
7 
8 namespace NetworKit {
9 
14 public:
21  LocalPartitionCoverage(const Graph& G, const Partition &P);
22 
26  virtual void run() override;
27 
33  virtual double maximum() override;
34 
39  virtual bool isParallel() const override;
40 
45  virtual std::string toString() const override;
46 protected:
47  const Partition& P;
48 };
49 
50 }
51 
52 #endif // LOCALPARTITIONCOVERAGE_H
const Partition & P
Definition: LocalPartitionCoverage.h:47
virtual double maximum() override
Get the maximum value (1.0)
Definition: LocalPartitionCoverage.cpp:31
virtual bool isParallel() const override
This algorithm is parallel.
Definition: LocalPartitionCoverage.cpp:35
const Graph & G
Definition: Centrality.h:91
virtual std::string toString() const override
The name of this algorithm.
Definition: LocalPartitionCoverage.cpp:39
Implements a partition of a set, i.e.
Definition: Partition.h:31
The local partition coverage is the amount of neighbors of a node u that are in the same partition as...
Definition: LocalPartitionCoverage.h:13
Abstract base class for centrality measures.
Definition: Centrality.h:20
LocalPartitionCoverage(const Graph &G, const Partition &P)
Construct the local partition coverage instance.
Definition: LocalPartitionCoverage.cpp:7
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
virtual void run() override
Computes local partition coverage on the graph passed in constructor.
Definition: LocalPartitionCoverage.cpp:11