pub fn betweenness_centrality(graph: &Graph, normalized: bool) -> Vec<f64>
Betweenness centrality via Brandes’ algorithm for weighted graphs. When normalized, scores are divided by (n - 1)(n - 2) (directed graphs).
normalized
(n - 1)(n - 2)