pub fn edge_betweenness(graph: &Graph) -> IgraphResult<Vec<f64>>Expand description
Per-edge unweighted betweenness centrality.
result[e] is the number of shortest paths between all vertex
pairs (s, t) (s != t) that use edge e. For undirected graphs
the result is halved (each unordered pair counted once).
Counterpart of
igraph_edge_betweenness(_, NULL_weights, _, /*eids=*/all, /*directed=*/g.is_directed(), /*normalized=*/false).
ยงExamples
use rust_igraph::{Graph, edge_betweenness};
// Path 0-1-2-3 (3 edges): every edge sits on every pair through it.
// Edge 0 (0-1) carries (0,1),(0,2),(0,3) = 3 pairs.
// Edge 1 (1-2) carries (0,2),(0,3),(1,2),(1,3) = 4 pairs.
// Edge 2 (2-3) carries (0,3),(1,3),(2,3) = 3 pairs.
let mut g = Graph::with_vertices(4);
for i in 0..3u32 { g.add_edge(i, i + 1).unwrap(); }
let eb = edge_betweenness(&g).unwrap();
assert_eq!(eb, vec![3.0, 4.0, 3.0]);