open-hypergraphs 0.3.1

Data-Parallel Algorithms for Open Hypergraphs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

use open_hypergraphs::category::Arrow;
use open_hypergraphs::lax::{NodeId, OpenHypergraph};

#[derive(Clone, Debug, PartialEq)]
enum Obj {
    A,
    B,
    C,
}

#[derive(Clone, Debug, PartialEq)]
enum Op {
    F,
    G,
}

#[test]
fn test_compose_type_mismatch() {
    let f = OpenHypergraph::singleton(Op::F, vec![Obj::A], vec![Obj::B]);
    let g = OpenHypergraph::singleton(Op::G, vec![Obj::C], vec![Obj::A]);

    assert!(Arrow::compose(&f, &g).is_none());
}

#[test]
fn test_lax_compose_allows_mismatch_and_unifies_boundary() {
    let f = OpenHypergraph::singleton(Op::F, vec![Obj::A], vec![Obj::B]);
    let g = OpenHypergraph::singleton(Op::G, vec![Obj::C], vec![Obj::A]);

    let composed = f.lax_compose(&g).expect("arity matches");

    assert_eq!(composed.sources, vec![NodeId(0)]);
    assert_eq!(composed.targets, vec![NodeId(3)]);
    assert_eq!(composed.hypergraph.quotient.0, vec![NodeId(1)]);
    assert_eq!(composed.hypergraph.quotient.1, vec![NodeId(2)]);
}

#[test]
fn test_compose_matches_lax_compose_on_equal_boundaries() {
    let f = OpenHypergraph::singleton(Op::F, vec![Obj::A], vec![Obj::B]);
    let g = OpenHypergraph::singleton(Op::G, vec![Obj::B], vec![Obj::C]);

    let strict = Arrow::compose(&f, &g).expect("labels match");
    let lax = f.lax_compose(&g).expect("arity matches");

    assert_eq!(strict, lax);
}