Function bandwidth_lower_bound 

pub fn bandwidth_lower_bound(graph: &Graph) -> IgraphResult<u32>

Compute a lower bound on graph bandwidth.

Uses the degree-based bound: B(G) >= ceil(max_degree / 2). Also: for connected graphs, B(G) >= ceil((n-1) / diameter).

Returns the maximum of available lower bounds.

Examples

use rust_igraph::{Graph, bandwidth_lower_bound};

let g = Graph::from_edges(&[(0,1),(1,2),(2,3)], false, Some(4)).unwrap();
assert!(bandwidth_lower_bound(&g).unwrap() >= 1);