Function laplacian_spectrum 

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

Compute all Laplacian eigenvalues, sorted in ascending order.

Returns {0 = λ_1 ≤ λ_2 ≤ … ≤ λ_n}. The multiplicity of the zero eigenvalue equals the number of connected components.

Examples

use rust_igraph::{Graph, laplacian_spectrum};

// K_3: Laplacian eigenvalues {0, 3, 3}
let g = Graph::from_edges(&[(0,1),(1,2),(0,2)], false, Some(3)).unwrap();
let spec = laplacian_spectrum(&g).unwrap();
assert!(spec[0].abs() < 0.01);
assert!((spec[1] - 3.0).abs() < 0.1);