All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | Protected Attributes | List of all members
NetworKit::EigenvectorCentrality Class Reference

Computes the leading eigenvector of the graph's adjacency matrix (normalized in 2-norm). More...

#include <EigenvectorCentrality.h>

Public Member Functions

 EigenvectorCentrality (const Graph &G, double tol=1e-8)
 Constructs an EigenvectorCentrality object for the given Graph G. More...
 
virtual void run ()
 Computes eigenvector centrality on the graph passed in constructor. More...
 
- Public Member Functions inherited from NetworKit::Centrality
 Centrality (const Graph &G, bool normalized=false, bool computeEdgeCentrality=false)
 Constructs the Centrality class for the given Graph G. More...
 
virtual ~Centrality ()=default
 Default destructor. More...
 
virtual std::vector< double > scores (bool moveOut=false)
 Get a vector containing the centrality score for each node in the graph. More...
 
virtual std::vector< double > edgeScores ()
 Get a vector containing the edge centrality score for each edge in the graph (where applicable). More...
 
virtual std::vector< std::pair
< node, double > > 
ranking ()
 Get a vector of pairs sorted into descending order. More...
 
virtual double score (node v)
 Get the centrality score of node v calculated by run(). More...
 
virtual double maximum ()
 Get the theoretical maximum of centrality score in the given graph. More...
 
virtual double centralization ()
 Compute the centralization of a network with respect to some centrality measure. More...
 
- Public Member Functions inherited from NetworKit::Algorithm
 Algorithm ()
 Constructor to the algorithm base class. More...
 
virtual ~Algorithm ()=default
 Virtual default destructor. More...
 
bool hasFinished () const
 Indicates whether an algorithm has completed computation or not. More...
 
void assureFinished () const
 Assure that the algorithm has been run, throws a std::runtime_error otherwise. More...
 
virtual std::string toString () const
 Returns a string with the algorithm's name and its parameters, if there are any. More...
 
virtual bool isParallel () const
 

Protected Attributes

double tol
 
- Protected Attributes inherited from NetworKit::Centrality
const GraphG
 
std::vector< double > scoreData
 
std::vector< double > edgeScoreData
 
bool normalized
 
bool computeEdgeCentrality
 
- Protected Attributes inherited from NetworKit::Algorithm
bool hasRun
 A boolean variable indicating whether an algorithm has finished its computation or not. More...
 

Detailed Description

Computes the leading eigenvector of the graph's adjacency matrix (normalized in 2-norm).

Interpreted as eigenvector centrality score.

Constructor & Destructor Documentation

NetworKit::EigenvectorCentrality::EigenvectorCentrality ( const Graph G,
double  tol = 1e-8 
)

Constructs an EigenvectorCentrality object for the given Graph G.

tol defines the tolerance for convergence.

Parameters
[in]GThe graph.
[in]tolThe tolerance for convergence. TODO running time

Member Function Documentation

void NetworKit::EigenvectorCentrality::run ( )
virtual

Computes eigenvector centrality on the graph passed in constructor.

Implements NetworKit::Centrality.

Member Data Documentation

double NetworKit::EigenvectorCentrality::tol
protected

The documentation for this class was generated from the following files: