pub fn brandes_betweenness(
nodes: &HashSet<String>,
edges: &[Edge],
) -> HashMap<String, f64>Expand description
Compute betweenness centrality for all nodes using Brandes’ algorithm. Only traverses High-confidence edges (Calls, Extends, Implements, Embeds). Returns normalized scores in [0.0, 1.0] using directed graph factor (n-1)(n-2).