Function signless_laplacian_spectrum 

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

Compute the signless Laplacian spectrum, sorted ascending.

The signless Laplacian Q = D + A has all non-negative eigenvalues. The smallest eigenvalue q_1 = 0 if and only if the graph has a bipartite connected component.

For undirected graphs only.

Examples

use rust_igraph::{Graph, signless_laplacian_spectrum};

// K_3: Q eigenvalues {1, 1, 4} (sorted: {1, 1, 4})
let g = Graph::from_edges(&[(0,1),(1,2),(0,2)], false, Some(3)).unwrap();
let spec = signless_laplacian_spectrum(&g).unwrap();
assert!((spec[0] - 1.0).abs() < 0.1);
assert!((spec[2] - 4.0).abs() < 0.1);