All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
ApproxBetweenness.h
Go to the documentation of this file.
1 /*
2  * ApproxBetweenness.h
3  *
4  * Created on: 09.04.2014
5  * Author: cls
6  */
7 
8 #ifndef APPROXBETWEENNESS_H_
9 #define APPROXBETWEENNESS_H_
10 
11 #include "Centrality.h"
12 
13 namespace NetworKit {
14 
15 
22 
23 public:
24 
40  ApproxBetweenness(const Graph& G, const double epsilon=0.01, const double delta=0.1, const double universalConstant=1.0);
41 
45  void run() override;
46 
51 
52 
53 private:
54 
55  double epsilon;
56  double delta;
57  count r; // number of samples taken in last run
58  double universalConstant;
59 };
60 
61 } /* namespace NetworKit */
62 
63 #endif /* APPROXBETWEENNESS_H_ */
ApproxBetweenness(const Graph &G, const double epsilon=0.01, const double delta=0.1, const double universalConstant=1.0)
The algorithm approximates the betweenness of all vertices so that the scores are within an additive ...
Definition: ApproxBetweenness.cpp:25
count numberOfSamples()
Definition: ApproxBetweenness.cpp:118
Approximation of betweenness centrality according to algorithm described in Matteo Riondato and Evgen...
Definition: ApproxBetweenness.h:21
const Graph & G
Definition: Centrality.h:91
Abstract base class for centrality measures.
Definition: Centrality.h:20
uint64_t count
Definition: Globals.h:21
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
void run() override
Computes betweenness approximation on the graph passed in constructor.
Definition: ApproxBetweenness.cpp:30