pub fn treewidth_upper_bound(adj: &[Vec<usize>]) -> usize
Naive treewidth computation for small graphs using elimination ordering. Returns an upper bound on treewidth via a greedy minimum-degree elimination.