pub fn closeness_centralization(graph: &Graph) -> IgraphResult<f64>Expand description
Compute closeness centralization.
sum(max_cc - cc[v]) / ((n-2)*(n-1)/(2*n-3)) — Freeman
closeness centralization. Returns 0.0 for disconnected or
trivial graphs.
§Examples
use rust_igraph::{Graph, closeness_centralization};
// K_3: all closeness = 1.0 → centralization = 0
let g = Graph::from_edges(&[(0,1),(1,2),(0,2)], false, Some(3)).unwrap();
assert!(closeness_centralization(&g).unwrap().abs() < 1e-10);