graaf 0.112.0

Work with directed graphs.
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
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

//! Check whether a sequence is a walk in a digraph.
//!
//! A sequence of vertices is a walk in a digraph if each pair of consecutive
//! vertices in the sequence is an arc in the digraph.
//!
//! # Examples
//!
//! ```
//! use graaf::{
//!     AdjacencyList,
//!     Circuit,
//!     HasWalk,
//! };
//!
//! let digraph = AdjacencyList::circuit(2);
//!
//! assert!(digraph.has_walk(&[0, 1]));
//! assert!(digraph.has_walk(&[1, 0]));
//!
//! assert!(!digraph.has_walk(&[0]));
//! assert!(!digraph.has_walk(&[1]));
//! assert!(!digraph.has_walk(&[2]));
//! assert!(!digraph.has_walk(&[0, 0]));
//! assert!(!digraph.has_walk(&[1, 1]));
//! assert!(!digraph.has_walk(&[0, 2]));
//! ```

/// Digraph walk
pub trait HasWalk {
    /// Check whether the sequence is a walk in the digraph.
    ///
    /// # Arguments
    ///
    /// * `walk`: A sequence of vertices.
    ///
    /// # Examples
    ///
    /// ```
    /// use graaf::{
    ///     AdjacencyList,
    ///     Circuit,
    ///     HasWalk,
    /// };
    ///
    /// let digraph = AdjacencyList::circuit(2);
    ///
    /// assert!(digraph.has_walk(&[0, 1]));
    /// assert!(digraph.has_walk(&[1, 0]));
    ///
    /// assert!(!digraph.has_walk(&[0]));
    /// assert!(!digraph.has_walk(&[1]));
    /// assert!(!digraph.has_walk(&[2]));
    /// assert!(!digraph.has_walk(&[0, 0]));
    /// assert!(!digraph.has_walk(&[1, 1]));
    /// assert!(!digraph.has_walk(&[0, 2]));
    /// ```
    #[must_use]
    fn has_walk(&self, walk: &[usize]) -> bool;
}

/// `HasWalk` tests
#[macro_export]
macro_rules! test_has_walk {
    ($fixture:path) => {
        use $fixture::{
            bang_jensen_34,
            bang_jensen_94,
            kattis_builddeps,
            kattis_escapewallmaria_1,
            kattis_escapewallmaria_2,
            kattis_escapewallmaria_3,
        };

        #[test]
        fn has_walk_bang_jensen_34() {
            let digraph = bang_jensen_34();

            assert!(digraph.has_walk(&[0, 4]));
            assert!(digraph.has_walk(&[1, 0, 4]));
            assert!(digraph.has_walk(&[2, 1, 0, 4]));
            assert!(digraph.has_walk(&[2, 3]));
            assert!(digraph.has_walk(&[2, 5, 4]));
            assert!(digraph.has_walk(&[5, 4]));

            assert!(!digraph.has_walk(&[0, 1]));
            assert!(!digraph.has_walk(&[1, 2]));
            assert!(!digraph.has_walk(&[2, 0]));
            assert!(!digraph.has_walk(&[3]));
            assert!(!digraph.has_walk(&[4]));
            assert!(!digraph.has_walk(&[5, 0]));
        }

        #[test]
        fn has_walk_bang_jensen_94() {
            let digraph = bang_jensen_94();

            assert!(digraph.has_walk(&[0, 1, 3, 5]));
            assert!(digraph.has_walk(&[0, 2, 1, 3, 5]));
            assert!(digraph.has_walk(&[0, 2, 3, 5]));
            assert!(digraph.has_walk(&[0, 2, 4, 6]));
            assert!(digraph.has_walk(&[0, 2, 5]));
            assert!(digraph.has_walk(&[1, 3, 5]));
            assert!(digraph.has_walk(&[2, 1, 3, 5]));
            assert!(digraph.has_walk(&[2, 3, 5]));
            assert!(digraph.has_walk(&[2, 4, 6]));
            assert!(digraph.has_walk(&[2, 5]));
            assert!(digraph.has_walk(&[3, 5]));
            assert!(digraph.has_walk(&[4, 6]));

            assert!(!digraph.has_walk(&[0, 3]));
            assert!(!digraph.has_walk(&[1, 0]));
            assert!(!digraph.has_walk(&[2, 0]));
            assert!(!digraph.has_walk(&[3, 0]));
            assert!(!digraph.has_walk(&[4, 0]));
            assert!(!digraph.has_walk(&[5]));
            assert!(!digraph.has_walk(&[6]));
        }

        #[test]
        fn has_walk_kattis_builddeps() {
            let digraph = kattis_builddeps();

            assert!(digraph.has_walk(&[0, 3, 1]));
            assert!(digraph.has_walk(&[0, 4, 1]));
            assert!(digraph.has_walk(&[2, 3, 1]));
            assert!(digraph.has_walk(&[2, 4, 1]));
            assert!(digraph.has_walk(&[2, 5, 1]));
            assert!(digraph.has_walk(&[3, 1]));
            assert!(digraph.has_walk(&[4, 1]));
            assert!(digraph.has_walk(&[5, 1]));

            assert!(!digraph.has_walk(&[0, 1]));
            assert!(!digraph.has_walk(&[1]));
            assert!(!digraph.has_walk(&[2, 0]));
            assert!(!digraph.has_walk(&[3, 0]));
            assert!(!digraph.has_walk(&[4, 0]));
            assert!(!digraph.has_walk(&[5, 0]));
        }

        #[test]
        fn has_walk_kattis_escapewallmaria_1() {
            let digraph = kattis_escapewallmaria_1();

            assert!(digraph.has_walk(&[5, 6, 5]));
            assert!(digraph.has_walk(&[5, 9, 5]));
            assert!(digraph.has_walk(&[5, 9, 13, 9]));
            assert!(digraph.has_walk(&[5, 9, 13, 12]));
            assert!(digraph.has_walk(&[6, 5, 6]));
            assert!(digraph.has_walk(&[6, 5, 9, 13, 9]));
            assert!(digraph.has_walk(&[6, 5, 9, 13, 12]));
            assert!(digraph.has_walk(&[9, 5, 6, 5]));
            assert!(digraph.has_walk(&[9, 5, 9]));
            assert!(digraph.has_walk(&[9, 13, 9]));
            assert!(digraph.has_walk(&[9, 13, 12]));
            assert!(digraph.has_walk(&[13, 9, 5, 6, 5]));
            assert!(digraph.has_walk(&[13, 9, 5, 9]));
            assert!(digraph.has_walk(&[13, 9, 13]));
            assert!(digraph.has_walk(&[13, 12]));

            assert!(!digraph.has_walk(&[0]));
            assert!(!digraph.has_walk(&[1]));
            assert!(!digraph.has_walk(&[2]));
            assert!(!digraph.has_walk(&[3]));
            assert!(!digraph.has_walk(&[4]));
            assert!(!digraph.has_walk(&[5, 0]));
            assert!(!digraph.has_walk(&[6, 0]));
            assert!(!digraph.has_walk(&[7]));
            assert!(!digraph.has_walk(&[8]));
            assert!(!digraph.has_walk(&[9, 0]));
            assert!(!digraph.has_walk(&[10]));
            assert!(!digraph.has_walk(&[11]));
            assert!(!digraph.has_walk(&[12]));
            assert!(!digraph.has_walk(&[13, 0]));
        }

        #[test]
        fn has_walk_kattis_escapewallmaria_2() {
            let digraph = kattis_escapewallmaria_2();

            assert!(digraph.has_walk(&[5, 6, 5]));
            assert!(digraph.has_walk(&[5, 9, 5]));
            assert!(digraph.has_walk(&[6, 5, 6]));
            assert!(digraph.has_walk(&[6, 5, 9, 5]));
            assert!(digraph.has_walk(&[9, 5, 6, 5]));
            assert!(digraph.has_walk(&[9, 5, 9]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 6, 5]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 9]));
            assert!(digraph.has_walk(&[12, 13, 12]));
            assert!(digraph.has_walk(&[13, 9, 5, 6, 5]));
            assert!(digraph.has_walk(&[13, 9, 5, 9]));
            assert!(digraph.has_walk(&[13, 12, 13]));

            assert!(!digraph.has_walk(&[0]));
            assert!(!digraph.has_walk(&[1]));
            assert!(!digraph.has_walk(&[2]));
            assert!(!digraph.has_walk(&[3]));
            assert!(!digraph.has_walk(&[4]));
            assert!(!digraph.has_walk(&[5, 0]));
            assert!(!digraph.has_walk(&[6, 0]));
            assert!(!digraph.has_walk(&[7]));
            assert!(!digraph.has_walk(&[8]));
            assert!(!digraph.has_walk(&[9, 0]));
            assert!(!digraph.has_walk(&[10]));
            assert!(!digraph.has_walk(&[11]));
            assert!(!digraph.has_walk(&[12, 0]));
            assert!(!digraph.has_walk(&[13, 0]));
        }

        #[test]
        fn has_walk_kattis_escapewallmaria_3() {
            let digraph = kattis_escapewallmaria_3();

            assert!(digraph.has_walk(&[1, 2, 1]));
            assert!(digraph.has_walk(&[1, 2, 6, 2]));
            assert!(digraph.has_walk(&[1, 2, 6, 5, 1]));
            assert!(digraph.has_walk(&[1, 2, 6, 5, 6]));
            assert!(digraph.has_walk(&[1, 2, 6, 5, 9, 5]));
            assert!(digraph.has_walk(&[1, 2, 6, 5, 9, 13]));
            assert!(digraph.has_walk(&[1, 2, 6, 5, 9, 13, 9]));
            assert!(digraph.has_walk(&[1, 2, 6, 5, 9, 13, 12, 13]));
            assert!(digraph.has_walk(&[1, 5, 1]));
            assert!(digraph.has_walk(&[1, 5, 6, 2, 1]));
            assert!(digraph.has_walk(&[1, 5, 6, 2, 6]));
            assert!(digraph.has_walk(&[1, 5, 9, 5]));
            assert!(digraph.has_walk(&[1, 5, 9, 13, 9]));
            assert!(digraph.has_walk(&[1, 5, 9, 13, 12, 13]));
            assert!(digraph.has_walk(&[2, 1, 2]));
            assert!(digraph.has_walk(&[2, 1, 5, 1]));
            assert!(digraph.has_walk(&[2, 1, 5, 6, 2]));
            assert!(digraph.has_walk(&[2, 1, 5, 6, 5]));
            assert!(digraph.has_walk(&[2, 1, 5, 9, 5]));
            assert!(digraph.has_walk(&[2, 1, 5, 9, 13, 9]));
            assert!(digraph.has_walk(&[2, 1, 5, 9, 13, 12, 13]));
            assert!(digraph.has_walk(&[2, 6, 2]));
            assert!(digraph.has_walk(&[2, 6, 5, 1, 2]));
            assert!(digraph.has_walk(&[2, 6, 5, 1, 5]));
            assert!(digraph.has_walk(&[2, 6, 5, 6]));
            assert!(digraph.has_walk(&[2, 6, 5, 9, 5]));
            assert!(digraph.has_walk(&[2, 6, 5, 9, 13, 9]));
            assert!(digraph.has_walk(&[2, 6, 5, 9, 13, 12, 13]));
            assert!(digraph.has_walk(&[5, 1, 2, 1]));
            assert!(digraph.has_walk(&[5, 1, 2, 6, 2]));
            assert!(digraph.has_walk(&[5, 1, 2, 6, 5]));
            assert!(digraph.has_walk(&[5, 1, 5]));
            assert!(digraph.has_walk(&[5, 6, 2, 1, 2]));
            assert!(digraph.has_walk(&[5, 6, 2, 1, 5]));
            assert!(digraph.has_walk(&[5, 6, 2, 6]));
            assert!(digraph.has_walk(&[5, 6, 5]));
            assert!(digraph.has_walk(&[5, 9, 5]));
            assert!(digraph.has_walk(&[5, 9, 13, 9]));
            assert!(digraph.has_walk(&[5, 9, 13, 12, 13]));
            assert!(digraph.has_walk(&[6, 2, 1, 2]));
            assert!(digraph.has_walk(&[6, 2, 1, 5, 1]));
            assert!(digraph.has_walk(&[6, 2, 1, 5, 6]));
            assert!(digraph.has_walk(&[6, 2, 1, 5, 9, 5]));
            assert!(digraph.has_walk(&[6, 2, 1, 5, 9, 13, 9]));
            assert!(digraph.has_walk(&[6, 2, 1, 5, 9, 13, 12, 13]));
            assert!(digraph.has_walk(&[6, 2, 6]));
            assert!(digraph.has_walk(&[6, 5, 1, 2, 1]));
            assert!(digraph.has_walk(&[6, 5, 1, 5]));
            assert!(digraph.has_walk(&[6, 5, 6]));
            assert!(digraph.has_walk(&[6, 5, 9, 5]));
            assert!(digraph.has_walk(&[6, 5, 9, 13, 9]));
            assert!(digraph.has_walk(&[6, 5, 9, 13, 12, 13]));
            assert!(digraph.has_walk(&[9, 5, 1, 2, 1]));
            assert!(digraph.has_walk(&[9, 5, 1, 2, 6, 2]));
            assert!(digraph.has_walk(&[9, 5, 1, 2, 6, 5]));
            assert!(digraph.has_walk(&[9, 5, 1, 5]));
            assert!(digraph.has_walk(&[9, 5, 6, 2, 1, 2]));
            assert!(digraph.has_walk(&[9, 5, 6, 2, 1, 5]));
            assert!(digraph.has_walk(&[9, 5, 6, 2, 6]));
            assert!(digraph.has_walk(&[9, 5, 6, 5]));
            assert!(digraph.has_walk(&[9, 5, 9]));
            assert!(digraph.has_walk(&[9, 13, 9]));
            assert!(digraph.has_walk(&[9, 13, 12, 13]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 1, 2, 1]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 1, 5]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 6, 2, 1, 2]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 6, 2, 1, 5]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 6, 2, 6]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 6, 5]));
            assert!(digraph.has_walk(&[12, 13, 9, 5, 9]));
            assert!(digraph.has_walk(&[12, 13, 9, 13]));
            assert!(digraph.has_walk(&[12, 13, 12]));

            assert!(!digraph.has_walk(&[0]));
            assert!(!digraph.has_walk(&[1, 0]));
            assert!(!digraph.has_walk(&[2, 0]));
            assert!(!digraph.has_walk(&[3]));
            assert!(!digraph.has_walk(&[4]));
            assert!(!digraph.has_walk(&[5, 0]));
            assert!(!digraph.has_walk(&[6, 0]));
            assert!(!digraph.has_walk(&[7]));
            assert!(!digraph.has_walk(&[8]));
            assert!(!digraph.has_walk(&[9, 0]));
            assert!(!digraph.has_walk(&[10]));
            assert!(!digraph.has_walk(&[11]));
            assert!(!digraph.has_walk(&[12, 0]));
            assert!(!digraph.has_walk(&[13, 0]));
        }
    };
}