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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201

use open_hypergraphs::lax::{EdgeId, Hyperedge, Hypergraph, NodeId};

#[test]
fn test_delete_nodes_remap_and_quotient() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![10, 20, 30, 40];
    h.edges = vec![0];
    h.adjacency = vec![Hyperedge {
        sources: vec![NodeId(0), NodeId(1), NodeId(2), NodeId(3)],
        targets: vec![NodeId(3), NodeId(1)],
    }];
    h.quotient = (vec![NodeId(0), NodeId(1)], vec![NodeId(2), NodeId(3)]);

    h.delete_nodes(&[NodeId(1), NodeId(3)]);

    assert_eq!(h.nodes, vec![10, 30]);
    assert_eq!(h.adjacency.len(), 1);
    assert_eq!(h.adjacency[0].sources, vec![NodeId(0), NodeId(1)]);
    assert!(h.adjacency[0].targets.is_empty());
    assert_eq!(h.quotient.0, vec![NodeId(0)]);
    assert_eq!(h.quotient.1, vec![NodeId(1)]);
}

#[test]
fn test_delete_nodes_empty_input_no_change() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![1, 2];
    h.edges = vec![7];
    h.adjacency = vec![Hyperedge {
        sources: vec![NodeId(0)],
        targets: vec![NodeId(1)],
    }];
    h.quotient = (vec![NodeId(0)], vec![NodeId(1)]);

    h.delete_nodes(&[]);

    assert_eq!(h.nodes, vec![1, 2]);
    assert_eq!(h.edges, vec![7]);
    assert_eq!(h.adjacency[0].sources, vec![NodeId(0)]);
    assert_eq!(h.adjacency[0].targets, vec![NodeId(1)]);
    assert_eq!(h.quotient.0, vec![NodeId(0)]);
    assert_eq!(h.quotient.1, vec![NodeId(1)]);
}

#[test]
fn test_delete_nodes_all_nodes_removed() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![1, 2, 3];
    h.edges = vec![0];
    h.adjacency = vec![Hyperedge {
        sources: vec![NodeId(0), NodeId(2)],
        targets: vec![NodeId(1)],
    }];
    h.quotient = (vec![NodeId(0), NodeId(1)], vec![NodeId(2), NodeId(0)]);

    h.delete_nodes(&[NodeId(0), NodeId(1), NodeId(2)]);

    assert!(h.nodes.is_empty());
    assert_eq!(h.edges, vec![0]);
    assert!(h.adjacency[0].sources.is_empty());
    assert!(h.adjacency[0].targets.is_empty());
    assert!(h.quotient.0.is_empty());
    assert!(h.quotient.1.is_empty());
}

#[test]
#[should_panic]
fn test_delete_nodes_panics_on_out_of_range() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![5, 6];
    h.edges = vec![1];
    h.adjacency = vec![Hyperedge {
        sources: vec![NodeId(0)],
        targets: vec![NodeId(1)],
    }];
    h.quotient = (vec![NodeId(0)], vec![NodeId(1)]);

    h.delete_nodes(&[NodeId(99)]);
}

#[test]
fn test_delete_edge_single() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![10, 20, 30];
    h.edges = vec![1, 2, 3];
    h.adjacency = vec![
        Hyperedge {
            sources: vec![NodeId(0)],
            targets: vec![NodeId(1)],
        },
        Hyperedge {
            sources: vec![NodeId(2)],
            targets: vec![NodeId(0), NodeId(1)],
        },
        Hyperedge {
            sources: vec![],
            targets: vec![NodeId(2)],
        },
    ];
    h.quotient = (vec![NodeId(0)], vec![NodeId(2)]);

    h.delete_edges(&[EdgeId(1)]);

    assert_eq!(h.nodes, vec![10, 20, 30]);
    assert_eq!(h.edges, vec![1, 3]);
    assert_eq!(h.adjacency.len(), 2);
    assert_eq!(h.adjacency[0].sources, vec![NodeId(0)]);
    assert_eq!(h.adjacency[0].targets, vec![NodeId(1)]);
    assert_eq!(h.adjacency[1].sources, vec![]);
    assert_eq!(h.adjacency[1].targets, vec![NodeId(2)]);
    assert_eq!(h.quotient.0, vec![NodeId(0)]);
    assert_eq!(h.quotient.1, vec![NodeId(2)]);
}

#[test]
fn test_delete_edge_multiple_with_duplicates() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![1, 2];
    h.edges = vec![11, 22, 33, 44];
    h.adjacency = vec![
        Hyperedge {
            sources: vec![NodeId(0)],
            targets: vec![NodeId(1)],
        },
        Hyperedge {
            sources: vec![NodeId(1)],
            targets: vec![NodeId(0)],
        },
        Hyperedge {
            sources: vec![],
            targets: vec![NodeId(0)],
        },
        Hyperedge {
            sources: vec![NodeId(0), NodeId(1)],
            targets: vec![],
        },
    ];

    h.delete_edges(&[EdgeId(3), EdgeId(1), EdgeId(1)]);

    assert_eq!(h.edges, vec![11, 33]);
    assert_eq!(h.adjacency.len(), 2);
    assert_eq!(h.adjacency[0].sources, vec![NodeId(0)]);
    assert_eq!(h.adjacency[0].targets, vec![NodeId(1)]);
    assert_eq!(h.adjacency[1].sources, vec![]);
    assert_eq!(h.adjacency[1].targets, vec![NodeId(0)]);
}

#[test]
fn test_delete_edge_all_edges_removed() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![7, 8, 9];
    h.edges = vec![0, 1];
    h.adjacency = vec![
        Hyperedge {
            sources: vec![NodeId(0)],
            targets: vec![NodeId(2)],
        },
        Hyperedge {
            sources: vec![NodeId(1)],
            targets: vec![NodeId(0)],
        },
    ];

    h.delete_edges(&[EdgeId(0), EdgeId(1)]);

    assert!(h.edges.is_empty());
    assert!(h.adjacency.is_empty());
    assert_eq!(h.nodes, vec![7, 8, 9]);
}

#[test]
fn test_delete_edge_empty_input_no_change() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![1];
    h.edges = vec![99];
    h.adjacency = vec![Hyperedge {
        sources: vec![],
        targets: vec![NodeId(0)],
    }];

    h.delete_edges(&[]);

    assert_eq!(h.edges, vec![99]);
    assert_eq!(h.adjacency.len(), 1);
    assert_eq!(h.adjacency[0].targets, vec![NodeId(0)]);
}

#[test]
#[should_panic]
fn test_delete_edge_panics_on_out_of_bounds() {
    let mut h = Hypergraph::empty();
    h.nodes = vec![1];
    h.edges = vec![5];
    h.adjacency = vec![Hyperedge {
        sources: vec![],
        targets: vec![NodeId(0)],
    }];

    h.delete_edges(&[EdgeId(1)]);
}