Function normalized_algebraic_connectivity 

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

Compute the normalized algebraic connectivity μ_2(L_norm).

This is the second-smallest eigenvalue of the normalized Laplacian. It is in [0, 1] for connected graphs and equals 0 for disconnected ones. Unlike the combinatorial a(G) = λ_2(L), it is bounded independently of the graph size.

Examples

use rust_igraph::{Graph, normalized_algebraic_connectivity};

// K_3: μ_2 = 3/2
let g = Graph::from_edges(&[(0,1),(1,2),(0,2)], false, Some(3)).unwrap();
let mu2 = normalized_algebraic_connectivity(&g).unwrap();
assert!((mu2 - 1.5).abs() < 0.1);