pub fn vertex_resilience(graph: &Graph) -> IgraphResult<f64>Expand description
Compute vertex resilience κ(G) / n.
The fraction of vertices that must be removed to disconnect the
graph. Higher values indicate more robust graphs. Uses the
flow-based vertex_connectivity from the flow module internally.
§Examples
use rust_igraph::{Graph, vertex_resilience};
// K_4: κ = 3, n = 4, resilience = 0.75
let g = Graph::from_edges(
&[(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)], false, Some(4)
).unwrap();
let r = vertex_resilience(&g).unwrap();
assert!((r - 0.75).abs() < 0.01);