Function biconnected_ratio 

pub fn biconnected_ratio(graph: &Graph) -> IgraphResult<f64>

Compute the biconnected ratio.

Fraction of edges belonging to the largest biconnected component. A biconnected component is a maximal subgraph with no cut vertices. Higher values indicate the graph is dominated by a single robust block. Returns 0.0 for graphs with no edges.

Examples

use rust_igraph::{Graph, biconnected_ratio};

// K_4: entire graph is biconnected → 1.0
let g = Graph::from_edges(
    &[(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)], false, Some(4)
).unwrap();
assert!((biconnected_ratio(&g).unwrap() - 1.0).abs() < 1e-10);