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

use super::super::native::reconstruct_native_adjacency;

#[test]
fn readback_orders_lower_bags_before_native_forward_neighbors() {
    let native = vec![vec![4, 2, 1], vec![3, 0], vec![0], vec![1], vec![0]];

    assert_eq!(
        reconstruct_native_adjacency(&native),
        vec![vec![4, 2, 1], vec![0, 3], vec![0], vec![1], vec![0]],
    );
}