#cdf-show-file.cdf-text { top:105px; } .ObsBanner {color:black; width:430px; padding-left:7px; padding-right:7px; padding-top:6px; padding-bottom:6px; position:absolute; left:180px; top:125px; font-size:10px; font-weight:normal; font-family:Verdana, Arial, Helvetica, sans-serif; font-stretch:narrow; background:#fffdc8; border:solid 2px #ffbb33; line-height:16px; z-index:3;} .ObsBanner a:link {font-weight:bold; color:#cc6600;} .ObsBanner a:hover {font-weight:bold; color:#cc6600;} .ObsBanner a:visited {font-weight:bold; color:#cc6600;} THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT. SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
 MATHEMATICA 内置符号 参见 »| 更多关于 »

# ClosenessCentrality

 ClosenessCentrality[g] gives a list of closeness centralities for the vertices in the graph g.
• ClosenessCentrality for a graph g is given as where is the average distance from vertex to all other vertices connected to .
• If is the distance matrix then the average distance from vertex to all connected vertices is given by , where the sum is taken over all finite and is the number of vertices connected to .
• The closeness centrality for isolated vertices is taken to be zero.
 例   (2)
Find the closeness centrality for each vertex in a connected graph:
Closeness is computed separately for each connected component:
Find the closeness centrality for each vertex in a connected graph:
 Out[1]=

Closeness is computed separately for each connected component:
 Out[1]=
 范围   (3)
ClosenessCentrality for undirected graphs:
Highlight the vertex with highest centrality:
Directed graphs:
Highlight the vertex with highest centrality:
Work with large graphs:
 应用   (2)
Highlight the closeness centrality for CycleGraph:
An unbalanced tree:
Create a social network:
Find the people with more direct influence on others:
 属性和关系   (3)
ClosenessCentrality is the inverse of average finite distances to other vertices:
An undirected graph:
A directed graph:
Closeness centrality for isolated vertices is taken to be zero:
Closeness centralities for an undirected graph are equivalent to centralities for each component:
Computing the centralities for each component yields the same result:

 使用条款  • 隐私政策  • 网站索引 选择语言