GRAPH UTILITIES 程序包 符号

# ClosenessCentrality

ClosenessCentrality[g]
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

## 范例范例打开所有单元关闭所有单元

### 基本范例 (2)基本范例 (2)

This defines a small graph:

 Out[3]=

This shows that vertex 2, being at the center of this graph, has a higher closeness centrality:

 Out[4]=

This defines a disconnected graph and finds the closeness centrality:

 Out[3]=
 Out[4]=

## 教程教程

New to Mathematica? Find your learning path »
Have a question? Ask support »