networkx.algorithms.centrality.closeness_centrality

networkx.algorithms.centrality.closeness_centrality(G, v=None, distance=None, normalized=True)

Compute closeness centrality for nodes.

Closeness centrality at a node is 1/average distance to all other nodes.

Parameters :

G : graph

A networkx graph

v : node, optional

Return only the value for node v

distance : string key, optional (default=None)

Use specified edge key as edge distance. If True, use ‘weight’ as the edge key.

normalized : bool, optional

If True (default) normalize by the graph size.

Returns :

nodes : dictionary

Dictionary of nodes with closeness centrality as the value.

See also

betweenness_centrality, load_centrality, eigenvector_centrality, degree_centrality

Notes

The closeness centrality is normalized to to n-1 / size(G)-1 where n is the number of nodes in the connected part of graph containing the node. If the graph is not completely connected, this algorithm computes the closeness centrality for each connected part separately.