xdag 0.1.4

A simple Rust DAG(Directed Acyclic Graph) lib
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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251

use super::Dag;
use crate::DagError;

#[test]
fn basic() {
    let mut dag = Dag::new();

    dag.insert_node(2, ());
    dag.insert_node(4, ());
    dag.insert_node(3, ());

    dag.insert_edge(2, 3, ()).unwrap();
    dag.insert_edge(2, 4, ()).unwrap();

    let roots = dag.roots().map(|(id, _)| id).collect::<Vec<_>>();
    let leaves = dag.leaves().map(|(id, _)| id).collect::<Vec<_>>();

    assert_eq!(&roots, &[2]);
    for id in [3, 4].iter() {
        assert!(leaves.contains(id))
    }
}

#[test]
fn cycle_test() {
    let mut dag = Dag::new();

    dag.insert_node(2, ());
    dag.insert_node(4, ());
    dag.insert_node(3, ());

    dag.insert_edge(2, 3, ()).unwrap();
    dag.insert_edge(3, 4, ()).unwrap();
    let result = dag.insert_edge(4, 2, ());
    assert!(result.is_err());
    if let DagError::HasCycle(from, to, data) = result.err().unwrap() {
        assert_eq!(from, 4);
        assert_eq!(to, 2);
        assert_eq!(data, ());
    } else {
        unreachable!();
    }
}

#[test]
fn insert_and_remove() {
    let mut dag = Dag::new();

    // build a dag
    dag.insert_node(1, 'A');
    dag.insert_node(2, 'B');
    dag.insert_node(3, 'C');
    dag.insert_node(4, 'D');
    dag.insert_node(5, 'E');

    dag.insert_edge(1, 2, 'a').unwrap();
    dag.insert_edge(2, 3, 'b').unwrap();
    dag.insert_edge(4, 2, 'c').unwrap();
    dag.insert_edge(4, 5, 'd').unwrap();
    dag.insert_edge(3, 5, 'e').unwrap();
    let result = dag.insert_edge(3, 4, 'f');
    // it must fail and dag will not be destoryed
    assert!(result.is_err());
    if let DagError::HasCycle(from, to, data) = result.unwrap_err() {
        assert_eq!(from, 3);
        assert_eq!(to, 4);
        assert_eq!(data, 'f');
    } else {
        unreachable!()
    }

    // check dag
    {
        // root
        let roots = dag.roots().map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&roots, &[1, 4]);
        // leaves
        let leaves = dag.leaves().map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&leaves, &[5]);
        // all nodes
        let children = dag.children(1).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[2]);

        let children = dag.children(2).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[3]);

        let children = dag.children(3).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[5]);

        let children = dag.children(4).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[2, 5]);

        let children = dag.children(5).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[]);

        // parents
        let parents = dag.parents(1).collect::<Vec<_>>();
        assert_eq!(&parents, &[]);

        let parents = dag.parents(2).collect::<Vec<_>>();
        assert_eq!(&parents, &[1, 4]);

        let parents = dag.parents(3).collect::<Vec<_>>();
        assert_eq!(&parents, &[2]);

        let parents = dag.parents(4).collect::<Vec<_>>();
        assert_eq!(&parents, &[]);

        let parents = dag.parents(5).collect::<Vec<_>>();
        assert_eq!(&parents, &[3, 4]);

        // data stored in node
        let node_data = (1..=5)
            .map(|node| dag.get_node(node).unwrap())
            .copied()
            .collect::<Vec<_>>();
        assert_eq!(&node_data, &['A', 'B', 'C', 'D', 'E']);
        // edge_data test
        let mut edges_data = dag
            .edges()
            .map(|(_, _, data)| data)
            .copied()
            .collect::<Vec<_>>();
        edges_data.sort();
        assert_eq!(&edges_data, &['a', 'b', 'c', 'd', 'e']);
    }

    let result = dag.remove_edge(3, 5);
    assert!(result.is_ok());
    let result = result.unwrap();
    assert!(result.is_some());
    assert_eq!(result.unwrap(), 'e');

    {
        // root
        let roots = dag.roots().map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&roots, &[1, 4]);
        // leaves
        let leaves = dag.leaves().map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&leaves, &[3, 5]);
        // all nodes
        let children = dag.children(1).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[2]);

        let children = dag.children(2).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[3]);

        let children = dag.children(3).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[]);

        let children = dag.children(4).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[2, 5]);

        let children = dag.children(5).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[]);

        // parents
        let parents = dag.parents(1).collect::<Vec<_>>();
        assert_eq!(&parents, &[]);

        let parents = dag.parents(2).collect::<Vec<_>>();
        assert_eq!(&parents, &[1, 4]);

        let parents = dag.parents(3).collect::<Vec<_>>();
        assert_eq!(&parents, &[2]);

        let parents = dag.parents(4).collect::<Vec<_>>();
        assert_eq!(&parents, &[]);

        let parents = dag.parents(5).collect::<Vec<_>>();
        assert_eq!(&parents, &[4]);

        // data stored in node
        let node_data = (1..=5)
            .map(|node| dag.get_node(node).unwrap())
            .copied()
            .collect::<Vec<_>>();
        assert_eq!(&node_data, &['A', 'B', 'C', 'D', 'E']);
        // edge_data test
        let mut edges_data = dag
            .edges()
            .map(|(_, _, data)| data)
            .copied()
            .collect::<Vec<_>>();
        edges_data.sort();
        assert_eq!(&edges_data, &['a', 'b', 'c', 'd']);
    }

    let (node_data, mut edges_data) = dag.remove_node(2);
    assert!(node_data.is_some());
    assert_eq!(node_data.unwrap(), 'B');
    edges_data.sort();
    assert_eq!(&edges_data, &['a', 'b', 'c']);
    {
        // root
        let roots = dag.roots().map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&roots, &[1, 3, 4]);
        // leaves
        let leaves = dag.leaves().map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&leaves, &[1, 3, 5]);
        // all nodes
        let children = dag.children(1).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[]);

        let children = dag.children(2).map(|(id, _)| id).collect::<Vec<_>>();
        // when id desn't exist in dag, it yield None
        assert_eq!(&children, &[]);

        let children = dag.children(3).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[]);

        let children = dag.children(4).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[5]);

        let children = dag.children(5).map(|(id, _)| id).collect::<Vec<_>>();
        assert_eq!(&children, &[]);

        // parents
        let parents = dag.parents(1).collect::<Vec<_>>();
        assert_eq!(&parents, &[]);

        let parents = dag.parents(2).collect::<Vec<_>>();
        assert_eq!(&parents, &[]);

        let parents = dag.parents(3).collect::<Vec<_>>();
        assert_eq!(&parents, &[]);

        let parents = dag.parents(4).collect::<Vec<_>>();
        assert_eq!(&parents, &[]);

        let parents = dag.parents(5).collect::<Vec<_>>();
        assert_eq!(&parents, &[4]);

        // data stored in node
        let node_data = (1..=5)
            .map(|node| dag.get_node(node))
            .filter(|node| node.is_some())
            .map(|node| node.unwrap())
            .copied()
            .collect::<Vec<_>>();
        assert_eq!(&node_data, &['A', 'C', 'D', 'E']);
        // edge_data test
        let mut edges_data = dag
            .edges()
            .map(|(_, _, data)| data)
            .copied()
            .collect::<Vec<_>>();
        edges_data.sort();
        assert_eq!(&edges_data, &['d']);
    }
}