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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
#![cfg(test)]
mod unit_tests {
use crate::error::Error;
use crate::graph::*;
use alloc::collections::{BTreeMap, BTreeSet};
#[test]
fn test_graph() {
let graph: BTreeGraph<usize, usize> = BTreeGraph::new();
assert_eq!(graph, BTreeGraph::new())
}
#[test]
fn definition() {
// Instantiate a graph using the new associated function.
let graph: BTreeGraph<usize, usize> = BTreeGraph::new();
let vertices: BTreeMap<usize, BTreeSet<usize>> = BTreeMap::new();
let edges: BTreeMap<usize, (usize, usize)> = BTreeMap::new();
// Check graph struct is generated.
assert_eq!(graph, BTreeGraph { vertices, edges })
// Test passed
}
#[test]
fn new_and_default() {
// Instantiate a graph using the implementation of default.
let graph: BTreeGraph<usize, usize> = BTreeGraph::new();
// Check graph struct is equivalent to the struct generated
// with the new associated function.
assert_eq!(graph, BTreeGraph::default())
// Test passed
}
#[test]
fn vertices() {
// Ensure there is a getter method for the vertices.
let graph: BTreeGraph<usize, usize> = BTreeGraph::new();
let vertices: BTreeSet<&usize> = BTreeSet::new();
assert_eq!(graph.vertices(), vertices)
// Test passed.
}
#[test]
fn edges() {
// Ensure there is a getter method for the edge.
let graph: BTreeGraph<usize, usize> = BTreeGraph::new();
let edges: BTreeSet<&usize> = BTreeSet::new();
assert_eq!(graph.edges(), edges)
// Test passed.
}
#[test]
fn add_vertex() {
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Verify nodes retain order on read.
let mut exp_vertices: BTreeSet<&usize> = BTreeSet::new();
exp_vertices.insert(&0);
exp_vertices.insert(&1);
exp_vertices.insert(&2);
assert_eq!(graph.vertices(), exp_vertices)
// Test passed.
}
#[test]
fn add_edge() -> Result<(), Error> {
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Add an edge (0, 1) = 2 and (1, 2) = 3.
graph.add_edge(0, 1, 2)?;
graph.add_edge(1, 2, 3)?;
// There should now be two edges.
let mut exp_edges: BTreeSet<&usize> = BTreeSet::new();
exp_edges.insert(&2);
exp_edges.insert(&3);
assert_eq!(graph.edges(), exp_edges);
// The value of (0, 1) is indeed 2.
let mut exp_edges_0: BTreeSet<usize> = BTreeSet::new();
exp_edges_0.insert(2);
assert_eq!(graph.get_vertex_value(0).unwrap(), &exp_edges_0);
// The value of (1, 2) is indeed 3.
let mut exp_edges_1: BTreeSet<usize> = BTreeSet::new();
exp_edges_1.insert(3);
assert_eq!(graph.get_vertex_value(1).unwrap(), &exp_edges_1);
// If you attempt to add an edge to a vertex that does not
// exist, then an error is raised.
assert_eq!(
graph.add_edge(0, 3, 0).unwrap_err(),
Error::VertexDoesNotExist
);
assert_eq!(
graph.add_edge(3, 0, 0).unwrap_err(),
Error::VertexDoesNotExist
);
assert_eq!(
graph.add_edge(1, 3, 0).unwrap_err(),
Error::VertexDoesNotExist
);
assert_eq!(
graph.add_edge(3, 1, 0).unwrap_err(),
Error::VertexDoesNotExist
);
// Tests passed.
Ok(())
}
#[test]
fn remove_vertex() -> Result<(), Error> {
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Add an edge (0, 1) = 2 and (1, 2) = 3.
graph.add_edge(0, 1, 2)?;
graph.add_edge(1, 2, 3)?;
// Verify there are two edges.
assert_eq!(graph.edges().len(), 2);
// Remove the first node.
graph.remove_vertex(0)?;
// Check there remain only two nodes.
let mut exp_vertices: BTreeSet<&usize> = BTreeSet::new();
exp_vertices.insert(&1);
exp_vertices.insert(&2);
assert_eq!(graph.vertices(), exp_vertices);
// Verify there are no dangling edges.
let mut exp_edges: BTreeSet<&usize> = BTreeSet::new();
exp_edges.insert(&3);
assert_eq!(graph.edges(), exp_edges);
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Add an edge (0, 1) = 2 and (1, 2) = 3.
graph.add_edge(0, 1, 2)?;
graph.add_edge(1, 2, 3)?;
// Verify there are two edges.
assert_eq!(graph.edges().len(), 2);
// Remove the first node.
graph.remove_vertex(1)?;
// Check there remain only two nodes.
let mut exp_vertices: BTreeSet<&usize> = BTreeSet::new();
exp_vertices.insert(&0);
exp_vertices.insert(&2);
assert_eq!(graph.vertices(), exp_vertices);
let exp_edges_0: BTreeSet<usize> = BTreeSet::new();
assert_eq!(graph.get_vertex_value(0).unwrap(), &exp_edges_0);
// Verify there are no edges at all.
let exp_edges: BTreeSet<&usize> = BTreeSet::new();
assert_eq!(graph.edges(), exp_edges);
// Remove vertex which does not exist.
assert_eq!(graph.remove_vertex(3).unwrap_err(), Error::VertexDoesNotExist);
Ok(())
// Test passed.
}
#[test]
fn remove_edge() -> Result<(), Error> {
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Add an edge (0, 1) = 2 and (1, 2) = 3.
graph.add_edge(0, 1, 2)?;
graph.add_edge(1, 2, 3)?;
// Verify there are two edges.
assert_eq!(graph.edges().len(), 2);
// Remove the first edge.
graph.remove_edge(2)?;
// Verify there are still three nodes.
assert_eq!(graph.vertices().len(), 3);
// Verify there remains only one edge;
assert_eq!(graph.edges().len(), 1);
// and that edge has a value (1, 2).
// let mut exp_edge: Edge<usize> = Edge::new();
// exp_edge.from = 1;
// exp_edge.to = 2;
assert_eq!(graph.get_edge_value(3).unwrap(), &(1, 2));
// Remove vertex which does not exist.
assert_eq!(graph.remove_edge(1).unwrap_err(), Error::EdgeDoesNotExist);
// Test passed.
Ok(())
}
#[test]
fn get_edge_value() -> Result<(), Error> {
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Add an edge (0, 1) = 2 and (1, 2) = 3.
graph.add_edge(0, 1, 2)?;
graph.add_edge(1, 2, 3)?;
// Verify there are two edges;
assert_eq!(graph.edges().len(), 2);
// and the first has a value (0, 1);
// let mut exp_edge_0: Edge<usize> = Edge::new();
// exp_edge_0.from = 0;
// exp_edge_0.to = 1;
assert_eq!(graph.get_edge_value(2).unwrap(), &(0, 1));
// and the second has a value (1, 2).
// let mut exp_edge_1: Edge<usize> = Edge::new();
// exp_edge_1.from = 1;
// exp_edge_1.to = 2;
assert_eq!(graph.get_edge_value(3).unwrap(), &(1, 2));
// Test passed.
Ok(())
}
#[test]
fn get_vertex_value() -> Result<(), Error> {
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Add an edge (0, 1) = 2 and (1, 2) = 3.
graph.add_edge(0, 1, 2)?;
graph.add_edge(1, 2, 3)?;
// Check there are in fact two edges.
assert_eq!(graph.edges().len(), 2);
let mut exp_edges_0: BTreeSet<usize> = BTreeSet::new();
exp_edges_0.insert(2);
assert_eq!(graph.get_vertex_value(0).unwrap(), &exp_edges_0);
let mut exp_edges_1: BTreeSet<usize> = BTreeSet::new();
exp_edges_1.insert(3);
assert_eq!(graph.get_vertex_value(1).unwrap(), &exp_edges_1);
// Test passed.
Ok(())
}
#[test]
fn adjacent() -> Result<(), Error> {
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Add an edge (0, 1) = 2 and (1, 2) = 3.
graph.add_edge(0, 1, 2)?;
graph.add_edge(1, 2, 3)?;
// Check there are in fact two edges.
assert_eq!(graph.edges().len(), 2);
// By definition vertices 0, and 1 are adjacent.
assert!(graph.adjacent(0, 1)?);
// By definition vertices 1, and 0 are not adjacent.
assert!(!graph.adjacent(1, 0)?);
// By definition vertices 1, and 2 are adjacent.
assert!(graph.adjacent(1, 2)?);
// By definition vertices 2, and 1 are not adjacent.
assert!(!graph.adjacent(2, 1)?);
// If we attempt to check adjacency on a node that does not exist,
// an error will be raised.
assert_eq!(graph.adjacent(0, 3).unwrap_err(), Error::VertexDoesNotExist);
assert_eq!(graph.adjacent(3, 0).unwrap_err(), Error::VertexDoesNotExist);
// Test passed.
Ok(())
}
#[test]
fn connections() -> Result<(), Error> {
// Add three nodes.
let mut graph: BTreeGraph<usize, usize> = BTreeGraph::new();
graph.add_vertex(0);
graph.add_vertex(1);
graph.add_vertex(2);
// Check there is indeed three nodes.
assert_eq!(graph.vertices().len(), 3);
// Add an edge (0, 1) = 2, (1, 2) = 3, and (0, 2) = 4.
graph.add_edge(0, 1, 2)?;
graph.add_edge(1, 2, 3)?;
graph.add_edge(0, 2, 4)?;
// Check there are in fact two edges.
assert_eq!(graph.edges().len(), 3);
// There should be, by definition, two nodes (1, and 2)
// 'connected' to node 0 through edges 2, and 4;
let mut exp_connections_0: BTreeSet<&usize> = BTreeSet::new();
exp_connections_0.insert(&1);
exp_connections_0.insert(&2);
assert_eq!(graph.connections(0)?, exp_connections_0);
// similarly node 1 is 'connected' to only node 2 through the edge 3.
let mut exp_connections_1: BTreeSet<&usize> = BTreeSet::new();
exp_connections_1.insert(&2);
assert_eq!(graph.connections(1)?, exp_connections_1);
// If we try to check connections on a node that does not exist,
// an error will be raised.
assert_eq!(graph.connections(3).unwrap_err(), Error::VertexDoesNotExist);
// Test passed.
Ok(())
}
}