All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
EigenvectorCentrality.h
Go to the documentation of this file.
1 /*
2  * EigenvectorCentrality.h
3  *
4  * Created on: 19.03.2014
5  * Author: Henning
6  */
7 
8 #ifndef EIGENVECTORCENTRALITY_H_
9 #define EIGENVECTORCENTRALITY_H_
10 
11 #include "Centrality.h"
12 
13 namespace NetworKit {
14 
21 protected:
22  double tol; // error tolerance
23 
24 public:
32  EigenvectorCentrality(const Graph& G, double tol = 1e-8);
33 
37  virtual void run();
38 };
39 
40 } /* namespace NetworKit */
41 #endif /* EIGENVECTORCENTRALITY_H_ */
Computes the leading eigenvector of the graph's adjacency matrix (normalized in 2-norm).
Definition: EigenvectorCentrality.h:20
double tol
Definition: EigenvectorCentrality.h:22
virtual void run()
Computes eigenvector centrality on the graph passed in constructor.
Definition: EigenvectorCentrality.cpp:19
EigenvectorCentrality(const Graph &G, double tol=1e-8)
Constructs an EigenvectorCentrality object for the given Graph G.
Definition: EigenvectorCentrality.cpp:13
const Graph & G
Definition: Centrality.h:91
Abstract base class for centrality measures.
Definition: Centrality.h:20
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79