Struct TreewidthHeuristic 

pub struct TreewidthHeuristic { /* private fields */ }

Greedy treewidth heuristic using the min-fill elimination ordering.

The min-fill heuristic eliminates the vertex that adds the fewest fill edges (edges between non-adjacent neighbors). This gives an upper bound on treewidth.

Implementations

impl TreewidthHeuristic

pub fn new(graph: &UndirectedGraph) -> Self

Create from an undirected graph.

pub fn run(&mut self) -> (Vec<usize>, usize)

Run min-fill elimination. Returns (elimination_order, upper_bound_on_treewidth).