As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>
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
Examplesopen allclose all
Basic Examples (2)
This function has been superseded by ClosenessCentrality in the Wolfram System:
Properties & Relations (1)
- Graph Utilities Package
- Graphs & Networks
- Graph Visualization
- Computation on Graphs
- Graph Construction & Representation
- Graphs and Matrices
- Graph Properties & Measurements
- Graph Operations and Modifications
- Statistical Analysis
- Social Network Analysis
- Graph Properties
- Mathematical Data Formats
- Discrete Mathematics