All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
DegreeCentrality.h
Go to the documentation of this file.
1 /*
2  * DegreeCentrality.h
3  *
4  * Created on: 19.02.2014
5  * Author: cls
6  */
7 
8 #ifndef DEGREECENTRALITY_H_
9 #define DEGREECENTRALITY_H_
10 
11 #include "Centrality.h"
12 
13 namespace NetworKit {
14 
21 public:
32  DegreeCentrality(const Graph& G, bool normalized=false, bool outDeg=true, bool ignoreSelfLoops=true);
33 
37  void run() override;
38 
42  double maximum() override;
43 
44 private:
45  bool outDeg, ignoreSelfLoops;
46 };
47 
48 } /* namespace NetworKit */
49 
50 #endif /* DEGREECENTRALITY_H_ */
bool normalized
Definition: Centrality.h:94
void run() override
Computes degree centraity on the graph passed in constructor.
Definition: DegreeCentrality.cpp:15
double maximum() override
Definition: DegreeCentrality.cpp:38
const Graph & G
Definition: Centrality.h:91
Node centrality index which ranks nodes by their degree.
Definition: DegreeCentrality.h:20
Abstract base class for centrality measures.
Definition: Centrality.h:20
DegreeCentrality(const Graph &G, bool normalized=false, bool outDeg=true, bool ignoreSelfLoops=true)
Constructs the DegreeCentrality class for the given Graph G.
Definition: DegreeCentrality.cpp:12
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79