compute closeness centrality
(optional) a vertex of G
ClosenessCentrality returns the closeness centrality for a specified vertex in the given graph G, or if no vertex is specified, returns a list of the closeness centralities for each vertex in G.
The closeness centrality of a vertex v is the reciprocal of the average graph distance between v and every vertex reachable from v.
Compute the closeness centrality for a specified graph.
G≔Graph 1: an undirected unweighted graph with 6 vertices and 8 edge(s)
The GraphTheory[ClosenessCentrality] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document
What kind of issue would you like to report? (Optional)