Module centrality 

Node centrality measures on a weighted Graph.

Functions

betweenness_centrality

Betweenness centrality via Brandes’ algorithm for weighted graphs. When normalized, scores are divided by (n - 1)(n - 2) (directed graphs).

closeness_centrality

Closeness centrality for every node. For node v with reachable set of size r and total distance s, closeness is (r - 1) / s. When normalized, it is scaled by (r - 1) / (n - 1) (Wasserman–Faust) to compare nodes in disconnected graphs. Isolated nodes get 0.