GraphUtilities`
GraphUtilities`
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)
Compute the closeness centrality:
This function has been superseded by ClosenessCentrality in the Wolfram System:
Options (1)
Wolfram Research (2007),ClosenessCentrality,Wolfram 语言函数,https://reference.wolfram.com/language/GraphUtilities/ref/ClosenessCentrality.html.
文本
Wolfram Research (2007),ClosenessCentrality,Wolfram 语言函数,https://reference.wolfram.com/language/GraphUtilities/ref/ClosenessCentrality.html.
CMS
Wolfram 语言. 2007. "ClosenessCentrality." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/ClosenessCentrality.html.
APA
Wolfram 语言. (2007). ClosenessCentrality. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/ClosenessCentrality.html 年