pub fn betweenness(g: &Adjacency) -> Vec<f32>
Betweenness centrality (Brandes’ algorithm, undirected, unweighted). The fraction of shortest paths through each node; normalised by (n-1)(n-2) so it lands in [0, 1]. O(n·m).
(n-1)(n-2)
[0, 1]
O(n·m)