Function treewidth_min_fill 

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

Compute an upper bound on treewidth via min-fill elimination.

Repeatedly eliminates the vertex that would introduce the fewest new edges (fill edges) when eliminated.

Examples

use rust_igraph::{Graph, treewidth_min_fill};

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