grape.general_graph.GeneralGraph.compute_closeness_centrality¶
-
GeneralGraph.compute_closeness_centrality()[source]¶ Closeness centrality calculation.
Note
Closeness centrality measures the reciprocal of the average shortest path distance from a node to all other reachable nodes in the graph. Thus, the more central a node is, the closer it is to all other nodes. This measure allows to identify good broadcasters, that is key elements in a graph, depicting how closely the nodes are connected with each other.
- Returns
closeness centrality computed for every node.
- Return type