OBSOLETE GRAPH UTILITIES 程序包 符号

# ClosenessCentrality

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>

ClosenessCentrality[g]
finds the closeness centrality.

## 更多信息更多信息

• ClosenessCentrality functionality is now available in the built-in Wolfram Language function ClosenessCentrality.
• To use ClosenessCentrality, 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)

 In[1]:=

This defines a small graph:

 In[2]:=
 In[3]:=
 Out[3]=

Compute the closeness centrality:

 In[4]:=
 Out[4]=

This function has been superseded by ClosenessCentrality in the Wolfram System:

 In[1]:=
 Out[1]=
 In[2]:=
 Out[2]=