finds the closeness centrality.
- To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- 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:
Weighted True whether edge weight is to be used in calculating distance Normalize False whether to normalize the output