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
//! Add an arc to a digraph.
//!
//! # Examples
//!
//! ```
//! use graaf::{
//! AddArc,
//! AdjacencyList,
//! Arcs,
//! Empty,
//! };
//!
//! let mut digraph = AdjacencyList::empty(3);
//!
//! digraph.add_arc(0, 1);
//! digraph.add_arc(0, 2);
//! digraph.add_arc(2, 0);
//!
//! assert!(digraph.arcs().eq([(0, 1), (0, 2), (2, 0)]));
//! ```
/// Add an arc to a digraph.
pub trait AddArc {
/// Add an arc from `u` to `v` to the digraph.
///
/// # Arguments
///
/// * `u`: The tail vertex.
/// * `v`: The head vertex.
///
/// # Panics
///
/// * Should panic if `u` equals `v`.
/// * Should panic if `u` isn't in the digraph.
/// * Should panic if `v` isn't in the digraph.
///
/// # Examples
///
/// ```
/// use graaf::{
/// AddArc,
/// AdjacencyList,
/// Arcs,
/// Empty,
/// };
///
/// let mut digraph = AdjacencyList::empty(3);
///
/// digraph.add_arc(0, 1);
/// digraph.add_arc(0, 2);
/// digraph.add_arc(2, 0);
///
/// assert!(digraph.arcs().eq([(0, 1), (0, 2), (2, 0)]));
/// ```
fn add_arc(&mut self, u: usize, v: usize);
}
/// `AddArc` self-loop tests
#[macro_export]
macro_rules! test_add_arc_self_loop {
($type:ty) => {
#[test]
#[should_panic(expected = "u = 0 equals v = 0")]
fn add_arc_u_equals_v() {
<$type>::trivial().add_arc(0, 0);
}
};
}
/// `AddArc` out-of-bounds tests
#[macro_export]
macro_rules! test_add_arc_out_of_bounds {
($type:ty) => {
#[test]
#[should_panic(expected = "v = 1 isn't in the digraph")]
fn add_arc_out_of_bounds_u() {
<$type>::trivial().add_arc(0, 1);
}
#[test]
#[should_panic(expected = "u = 1 isn't in the digraph")]
fn add_arc_out_of_bounds_v() {
<$type>::trivial().add_arc(1, 0);
}
};
}
/// `AddArc` proptests
#[macro_export]
macro_rules! proptest_add_arc {
($type:ty) => {
use {
$crate::{
proptest_strategy::arc,
Degree,
},
proptest::proptest,
};
proptest! {
#[test]
fn add_arc_degree((u, v) in arc(25_usize)) {
let mut digraph = <$type>::empty(100);
digraph.add_arc(u, v);
assert!(digraph.vertices().all(|x| {
digraph.degree(x) == usize::from(x == u) + usize::from(x == v)
}));
}
#[test]
fn add_arc_has_arc((u, v) in arc(25_usize)) {
let mut digraph = <$type>::empty(100);
digraph.add_arc(u, v);
assert!(digraph.has_arc(u, v));
}
#[test]
fn add_arc_indegree((u, v) in arc(25_usize)) {
let mut digraph = <$type>::empty(100);
digraph.add_arc(u, v);
assert!(digraph
.vertices()
.all(|x| digraph.indegree(x) == usize::from(x == v)));
}
#[test]
fn add_arc_outdegree((u, v) in arc(25_usize)) {
let mut digraph = <$type>::empty(100);
digraph.add_arc(u, v);
assert!(digraph
.vertices()
.all(|x| digraph.outdegree(x) == usize::from(x == u)));
}
#[test]
fn add_arc_remove_arc((u, v) in arc(25_usize)) {
let digraph = <$type>::empty(100);
let mut h = digraph.clone();
h.add_arc(u, v);
assert!(digraph.vertices().all(|x| digraph
.vertices()
.all(|y| h.remove_arc(x, y) == (x == u && y == v))));
assert_eq!(digraph, h);
}
}
}
}