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

//! Iterate a vertex's in-neighbors.
//!
//! # Examples
//!
//! ```
//! use graaf::{
//!     AddArc,
//!     AdjacencyList,
//!     Empty,
//!     InNeighbors,
//! };
//!
//! let mut digraph = AdjacencyList::empty(4);
//!
//! digraph.add_arc(0, 1);
//! digraph.add_arc(0, 2);
//! digraph.add_arc(1, 0);
//! digraph.add_arc(2, 0);
//! digraph.add_arc(2, 1);
//! digraph.add_arc(2, 3);
//! digraph.add_arc(3, 0);
//!
//! assert!(digraph.in_neighbors(0).eq([1, 2, 3]));
//! assert!(digraph.in_neighbors(1).eq([0, 2]));
//! assert!(digraph.in_neighbors(2).eq([0]));
//! assert!(digraph.in_neighbors(3).eq([2]));
//! ```
#![doc(alias = "iter_in_neighbours")]

/// Iterate a vertex's in-neighbors.
#[doc(alias = "InNeighbours")]
pub trait InNeighbors {
    /// Iterate the vertex's in-neighbors.
    ///
    /// # Arguments
    ///
    /// * `v`: The vertex.
    ///
    /// # Examples
    ///
    /// ```
    /// use graaf::{
    ///     AddArc,
    ///     AdjacencyList,
    ///     Empty,
    ///     InNeighbors,
    /// };
    ///
    /// let mut digraph = AdjacencyList::empty(4);
    ///
    /// digraph.add_arc(0, 1);
    /// digraph.add_arc(0, 2);
    /// digraph.add_arc(1, 0);
    /// digraph.add_arc(2, 0);
    /// digraph.add_arc(2, 1);
    /// digraph.add_arc(2, 3);
    /// digraph.add_arc(3, 0);
    ///
    /// assert!(digraph.in_neighbors(0).eq([1, 2, 3]));
    /// assert!(digraph.in_neighbors(1).eq([0, 2]));
    /// assert!(digraph.in_neighbors(2).eq([0]));
    /// assert!(digraph.in_neighbors(3).eq([2]));
    /// ```
    #[doc(alias = "in_neighbours")]
    #[must_use]
    fn in_neighbors(&self, v: usize) -> impl Iterator<Item = usize>;
}

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

        #[test]
        fn in_neighbors_bang_jensen_196() {
            let digraph = bang_jensen_196();

            assert!(digraph.in_neighbors(0).eq([1]));
            assert!(digraph.in_neighbors(1).eq([0]));
            assert!(digraph.in_neighbors(2).eq([1, 3, 4]));
            assert!(digraph.in_neighbors(3).eq([2]));
            assert!(digraph.in_neighbors(4).eq([0, 3]));
            assert!(digraph.in_neighbors(5).eq([7]));
            assert!(digraph.in_neighbors(6).eq([5]));
            assert!(digraph.in_neighbors(7).eq([0, 1, 6]));
        }

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

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

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

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

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

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

        #[test]
        fn in_neighbors_kattis_cantinaofbabel_1() {
            let digraph = kattis_cantinaofbabel_1();

            assert!(digraph.in_neighbors(0).eq([1]));
            assert!(digraph.in_neighbors(1).eq([0, 2]));
            assert!(digraph.in_neighbors(2).eq([1, 3]));
            assert!(digraph.in_neighbors(3).eq([4, 7]));
            assert!(digraph.in_neighbors(4).eq([1, 3]));
            assert!(digraph.in_neighbors(5).eq([3, 6]));
            assert!(digraph.in_neighbors(6).eq([5, 10]));
            assert!(digraph.in_neighbors(7).eq([3, 8, 9]));
            assert!(digraph.in_neighbors(8).eq([]));
            assert!(digraph.in_neighbors(9).eq([11]));
            assert!(digraph.in_neighbors(10).eq([3, 6, 8]));
            assert!(digraph.in_neighbors(11).eq([3, 9]));
        }

        #[test]
        fn in_neighbors_kattis_cantinaofbabel_2() {
            let digraph = kattis_cantinaofbabel_2();

            assert!(digraph.in_neighbors(0).eq([1, 2]));
            assert!(digraph.in_neighbors(1).eq([0]));
            assert!(digraph.in_neighbors(2).eq([7]));
            assert!(digraph.in_neighbors(3).eq([4, 5]));
            assert!(digraph.in_neighbors(4).eq([3]));
            assert!(digraph.in_neighbors(5).eq([2, 6]));
            assert!(digraph.in_neighbors(6).eq([5]));
            assert!(digraph.in_neighbors(7).eq([1, 2, 8]));
            assert!(digraph.in_neighbors(8).eq([9]));
            assert!(digraph.in_neighbors(9).eq([8, 10]));
            assert!(digraph.in_neighbors(10).eq([11]));
            assert!(digraph.in_neighbors(11).eq([8, 10]));
        }

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

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

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

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

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

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