goatd 0.1.1

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

//! Tests of the graph partitioner's private scoring representation.

mod initial;

use super::{MAX_BISECTION_EDGES, validate_size};
use crate::Error;

#[test]
fn csr_size_guard_bounds_the_directed_arc_count() {
    validate_size(MAX_BISECTION_EDGES).expect("the documented edge limit is inclusive");
    assert!(matches!(
        validate_size(MAX_BISECTION_EDGES + 1),
        Err(Error::TooLarge(_))
    ));
}