pub fn betweenness(graph: &Graph) -> IgraphResult<Vec<f64>>Expand description
Per-vertex (unweighted) betweenness centrality.
result[v] is the raw number of shortest paths between all
pairs (s, t) (s != v != t) that pass through v. For
undirected graphs the result is halved (each unordered pair (s, t)
is counted once).
Counterpart of
igraph_betweenness(_, _, vss_all(), /*directed=*/g.is_directed(), NULL).
§Examples
use rust_igraph::{Graph, betweenness};
// Path 0-1-2-3-4: only inner vertices have nonzero betweenness.
// Vertex 1 lies on shortest paths (0,2),(0,3),(0,4) → 3 pairs.
// Vertex 2: (0,3),(0,4),(1,3),(1,4) → 4 pairs.
// Vertex 3: 3 pairs. Endpoints 0, 4: 0 pairs.
let mut g = Graph::with_vertices(5);
for i in 0..4u32 { g.add_edge(i, i + 1).unwrap(); }
let b = betweenness(&g).unwrap();
assert_eq!(b, vec![0.0, 3.0, 4.0, 3.0, 0.0]);