Class HarmonicCloseness¶

Inheritance Relationships¶

Class Documentation¶

class HarmonicCloseness : public NetworKit::Centrality¶

Public Functions

HarmonicCloseness(const Graph &G, bool normalized = true)¶

Constructs the HarmonicCloseness class for the given Graph G. If the closeness scores should be normalized, then set normalized to true. The run() method takes O(nm) time, where n is the number of nodes and m is the number of edges of the graph.

Parameters:

• G – The graph.

• normalized – Set this parameter to false if scores should not be normalized into an interval of [0, 1]. Normalization only for unweighted graphs.

virtual void run() override¶

Computes the harmonic closeness centrality on the graph passed in constructor.

virtual double maximum() override¶

Get the theoretical maximum of centrality score in the given graph.

Returns:

The maximum centrality score.