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.
Details and Options
- 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
Examples
open allclose allBasic Examples (2)
Compute the closeness centrality:
This function has been superseded by ClosenessCentrality in the Wolfram System:
Options (1)
Wolfram Research (2007), ClosenessCentrality, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/ClosenessCentrality.html.
Text
Wolfram Research (2007), ClosenessCentrality, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/ClosenessCentrality.html.
CMS
Wolfram Language. 2007. "ClosenessCentrality." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/ClosenessCentrality.html.
APA
Wolfram Language. (2007). ClosenessCentrality. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/GraphUtilities/ref/ClosenessCentrality.html