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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156

use crate::lax::{Hyperedge, Hypergraph as LaxHypergraph, NodeId};
use crate::strict::graph;

#[test]
fn test_node_adjacency_simple_example() {
    // Nodes: 0, 1, 2
    // Edge e0: sources [0, 1] -> targets [2]
    let mut lax = LaxHypergraph::empty();
    lax.nodes = vec![0, 1, 2];
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(0), NodeId(1)],
            targets: vec![NodeId(2)],
        },
    );

    let strict = lax.to_hypergraph();
    let adjacency = graph::node_adjacency(&strict);

    let got: Vec<Vec<usize>> = adjacency.into_iter().map(|ff| ff.table.0).collect();

    let expected = vec![vec![2], vec![2], vec![]];
    assert_eq!(got, expected);
}

#[test]
fn test_operation_adjacency_simple_example() {
    // Nodes: 0, 1, 2
    // Edge e0: sources [0] -> targets [1]
    // Edge e1: sources [1] -> targets [2]
    let mut lax = LaxHypergraph::empty();
    lax.nodes = vec![0, 1, 2];
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(0)],
            targets: vec![NodeId(1)],
        },
    );
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(1)],
            targets: vec![NodeId(2)],
        },
    );

    let strict = lax.to_hypergraph();
    let adjacency = graph::operation_adjacency(&strict);

    let got: Vec<Vec<usize>> = adjacency.into_iter().map(|ff| ff.table.0).collect();
    let expected = vec![vec![1], vec![]];
    assert_eq!(got, expected);
}

#[test]
fn test_kahn_acyclic_chain() {
    // 0 -> 1 -> 2
    let mut lax = LaxHypergraph::empty();
    lax.nodes = vec![0, 1, 2];
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(0)],
            targets: vec![NodeId(1)],
        },
    );
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(1)],
            targets: vec![NodeId(2)],
        },
    );

    let strict = lax.to_hypergraph();
    let adjacency = graph::node_adjacency(&strict);
    let (_order, unvisited) = graph::kahn(&adjacency);

    assert_eq!(unvisited.0, vec![0, 0, 0]);
}

#[test]
fn test_kahn_cyclic() {
    // 0 -> 1 -> 0
    let mut lax = LaxHypergraph::empty();
    lax.nodes = vec![0, 1];
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(0)],
            targets: vec![NodeId(1)],
        },
    );
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(1)],
            targets: vec![NodeId(0)],
        },
    );

    let strict = lax.to_hypergraph();
    let adjacency = graph::node_adjacency(&strict);
    let (_order, unvisited) = graph::kahn(&adjacency);

    assert_eq!(unvisited.0, vec![1, 1]);
}

#[test]
fn test_kahn_disconnected_acyclic() {
    // 0 -> 1   and   2 isolated
    let mut lax = LaxHypergraph::empty();
    lax.nodes = vec![0, 1, 2];
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(0)],
            targets: vec![NodeId(1)],
        },
    );

    let strict = lax.to_hypergraph();
    let adjacency = graph::node_adjacency(&strict);
    let (_order, unvisited) = graph::kahn(&adjacency);

    assert_eq!(unvisited.0, vec![0, 0, 0]);
}

#[test]
fn test_kahn_disconnected_with_cycle() {
    // 0 -> 1 -> 0   and   2 isolated
    let mut lax = LaxHypergraph::empty();
    lax.nodes = vec![0, 1, 2];
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(0)],
            targets: vec![NodeId(1)],
        },
    );
    lax.new_edge(
        0,
        Hyperedge {
            sources: vec![NodeId(1)],
            targets: vec![NodeId(0)],
        },
    );

    let strict = lax.to_hypergraph();
    let adjacency = graph::node_adjacency(&strict);
    let (_order, unvisited) = graph::kahn(&adjacency);

    assert_eq!(unvisited.0, vec![1, 1, 0]);
}