Compute load centrality for nodes.
The fraction of number of shortests paths that go through each node counted according to the algorithm in Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality, M. E. J. Newman, Phys. Rev. E 64, 016132 (2001).
This actually computes ‘load’ which is slightly diferent than betweenness.
Returns a dictionary of betweenness values keyed by node. The betweenness is normalized to be between [0,1].
If normalized=False the resulting betweenness is not normalized.
If weighted_edges is True then use Dijkstra for finding shortest paths.