Class EigenvectorCentrality¶

Inheritance Relationships¶

Class Documentation¶

class EigenvectorCentrality : public NetworKit::Centrality¶

Computes the leading eigenvector of the graph’s adjacency matrix (normalized in 2-norm). Interpreted as eigenvector centrality score.

Public Functions

EigenvectorCentrality(const Graph &G, double tol = 1e-8)¶

Constructs an EigenvectorCentrality object for the given Graph G. tol defines the tolerance for convergence.

Parameters:

• G – [in] The graph.

• tol – [in] The tolerance for convergence. TODO running time

virtual void run() override¶

Computes eigenvector centrality on the graph passed in constructor.