networkx.betweenness_centrality¶

betweenness_centrality(G, normalized=True, weighted_edges=False)¶

Compute betweenness centrality for nodes.

Betweenness centrality of a node is the fraction of all shortest paths that pass through that node.

Parameters:

G : graph

A networkx graph

normalized : bool, optional

If True the betweenness values are normalized by b=b/(n-1)(n-2) where n is the number of nodes in G.

weighted_edges : bool, optional

Consider the edge weights in determining the shortest paths. If False, all edge weights are considered equal.

Returns:

nodes : dictionary

Dictionary of nodes with betweeness centrality as the value.