grape.general_graph.GeneralGraph.compute_betweenness_centrality

GeneralGraph.compute_betweenness_centrality()

Betweenness_centrality calculation

Note

Betweenness centrality is an index of the relative importance of a node and it is defined by the number of shortest paths that run through it. Nodes with the highest betweenness centrality hold the higher level of control on the information flowing between different nodes in the network, because more information will pass through them.

Returns

betweenness centrality computed for every node.

Return type

dict