pub fn closeness_centrality(graph: &Graph, normalized: bool) -> Vec<f64>Expand description
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.