This is documentation for Mathematica 6, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)


finds the closeness centrality.
  • The closeness centrality of a vertex u is defined as the inverse of the sum of the distance from u to all other vertices. The closeness centrality of a vertex in a disconnected graph is based on the closeness centrality of the component where this vertex belongs.
  • The following options can be given:
WeightedTruewhether edge weight is to be used in calculating distance
NormalizeFalsewhether to normalize the output