goatd 0.1.2

Greatest Of All Tree Decompositions: tree decompositions of graphs — elimination orders, FlowCutter, multilevel bisection — with PACE .gr/.td I/O and a command-line solver.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

//! The pure-Rust separator search, over the entry points the module keeps
//! inside `decompose`.

mod separator;

use super::{MAX_EXPANDED_BASE, validate_graph_size};

#[test]
fn expanded_graph_size_guard_checks_its_exact_boundary() {
    let vertices = 3;
    let max_edges = ((MAX_EXPANDED_BASE - vertices) / 2) as usize;

    validate_graph_size(vertices as u32, max_edges).expect("the index limit is inclusive");
    assert!(validate_graph_size(vertices as u32, max_edges + 1).is_err());
}