All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Betweenness.h
Go to the documentation of this file.
1 /*
2  * Betweenness.h
3  *
4  * Created on: 19.02.2014
5  * Author: cls, ebergamini
6  */
7 
8 #ifndef BETWEENNESS_H_
9 #define BETWEENNESS_H_
10 
11 #include "Centrality.h"
12 
13 namespace NetworKit {
14 
19 public:
29  Betweenness(const Graph& G, bool normalized=false, bool computeEdgeCentrality=false);
30 
31 
32 
36  void run() override;
37 
38  /*
39  * Returns the maximum possible Betweenness a node can have in a graph with the same amount of nodes (=a star)
40  */
41  double maximum() override;
42 
43 };
44 
45 } /* namespace NetworKit */
46 
47 #endif /* BETWEENNESS_H_ */
Betweenness(const Graph &G, bool normalized=false, bool computeEdgeCentrality=false)
Constructs the Betweenness class for the given Graph G.
Definition: Betweenness.cpp:24
bool normalized
Definition: Centrality.h:94
void run() override
Computes betweenness scores on the graph passed in constructor.
Definition: Betweenness.cpp:28
double maximum() override
Get the theoretical maximum of centrality score in the given graph.
Definition: Betweenness.cpp:126
const Graph & G
Definition: Centrality.h:91
bool computeEdgeCentrality
Definition: Centrality.h:95
Abstract base class for centrality measures.
Definition: Centrality.h:20
Definition: Betweenness.h:18
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79