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

//! Weighted adjacency list fixtures for testing and benchmarking

use {
    crate::{
        AdjacencyListWeighted,
        repr::adjacency_list::fixture::bang_jensen_94,
    },
    std::collections::BTreeMap,
};

/// Jørgen Bang-Jensen and Gregory Z. Gutin. 2009. Digraphs: Theory,
/// Algorithms and Applications (2nd ed.). Springer, London, 94.
/// <https://doi.org/10.1007/978-1-84800-998-1>
///
/// ![Bang-Jensen, 94](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/bang_jensen_94.svg)
#[must_use]
pub fn bang_jensen_94_usize() -> AdjacencyListWeighted<usize> {
    AdjacencyListWeighted::from(bang_jensen_94())
}

/// Jørgen Bang-Jensen and Gregory Z. Gutin. 2009. Digraphs: Theory,
/// Algorithms and Applications (2nd ed.). Springer, London, 94.
/// <https://doi.org/10.1007/978-1-84800-998-1>
///
/// ![Bang-Jensen, 94](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/bang_jensen_94.svg)
#[must_use]
pub fn bang_jensen_94_isize() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from(bang_jensen_94())
}

/// Jørgen Bang-Jensen and Gregory Z. Gutin. 2009. Digraphs: Theory,
/// Algorithms and Applications (2nd ed.). Springer, London, 96.
/// <https://doi.org/10.1007/978-1-84800-998-1>
///
/// ![Bang-Jensen, 96](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/bang_jensen_96.svg)
#[must_use]
pub fn bang_jensen_96_usize() -> AdjacencyListWeighted<usize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 9), (2, 3)]),
        BTreeMap::from([(2, 6), (3, 2)]),
        BTreeMap::from([(1, 2), (4, 1)]),
        BTreeMap::from([(5, 1)]),
        BTreeMap::from([(2, 2), (3, 2), (5, 7)]),
        BTreeMap::from([(3, 2)]),
    ])
}

/// Jørgen Bang-Jensen and Gregory Z. Gutin. 2009. Digraphs: Theory,
/// Algorithms and Applications (2nd ed.). Springer, London, 96.
/// <https://doi.org/10.1007/978-1-84800-998-1>
///
/// ![Bang-Jensen, 96](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/bang_jensen_96.svg)
#[must_use]
pub fn bang_jensen_96_isize() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 9), (2, 3)]),
        BTreeMap::from([(2, 6), (3, 2)]),
        BTreeMap::from([(1, 2), (4, 1)]),
        BTreeMap::from([(5, 1)]),
        BTreeMap::from([(2, 2), (3, 2), (5, 7)]),
        BTreeMap::from([(3, 2)]),
    ])
}

/// Jørgen Bang-Jensen and Gregory Z. Gutin. 2009. Digraphs: Theory,
/// Algorithms and Applications (2nd ed.). Springer, London, 99.
/// <https://doi.org/10.1007/978-1-84800-998-1>
///
/// ![Bang-Jensen, 99](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/bang_jensen_99.svg)
#[must_use]
pub fn bang_jensen_99() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 8), (2, 3)]),
        BTreeMap::from([(2, -5)]),
        BTreeMap::from([(3, -2), (4, 4)]),
        BTreeMap::from([(5, -2)]),
        BTreeMap::from([(3, 10), (5, 9)]),
        BTreeMap::from([(3, 5), (4, -3)]),
    ])
}

/// Arnar Bjarni Arnarson and Unnar Freyr Erlendsson. 2019. Bridges (Sample
/// Input 1). Kattis. <https://open.kattis.com/problems/bryr>
///
/// ![Kattis, bryr, sample 1](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_bryr_1.svg)
#[must_use]
pub fn kattis_bryr_1_usize() -> AdjacencyListWeighted<usize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 1), (2, 1)]),
        BTreeMap::from([(0, 1), (2, 1)]),
        BTreeMap::from([(0, 1), (1, 1)]),
    ])
}

/// Arnar Bjarni Arnarson and Unnar Freyr Erlendsson. 2019. Bridges (Sample
/// Input 1). Kattis. <https://open.kattis.com/problems/bryr>
///
/// ![Kattis, bryr, sample 1](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_bryr_1.svg)
#[must_use]
pub fn kattis_bryr_1_isize() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 1), (2, 1)]),
        BTreeMap::from([(0, 1), (2, 1)]),
        BTreeMap::from([(0, 1), (1, 1)]),
    ])
}

/// Arnar Bjarni Arnarson and Unnar Freyr Erlendsson. 2019. Bridges (Sample
/// Input 2). Kattis. <https://open.kattis.com/problems/bryr>
///
/// ![Kattis, bryr, sample 2](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_bryr_2.svg)
#[must_use]
pub fn kattis_bryr_2_usize() -> AdjacencyListWeighted<usize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 1), (3, 1)]),
        BTreeMap::from([(0, 1), (2, 1)]),
        BTreeMap::from([(1, 1), (3, 1)]),
        BTreeMap::from([(0, 1), (2, 1), (4, 1)]),
        BTreeMap::from([(3, 1), (5, 1)]),
        BTreeMap::from([(4, 1)]),
    ])
}

/// Arnar Bjarni Arnarson and Unnar Freyr Erlendsson. 2019. Bridges (Sample
/// Input 2). Kattis. <https://open.kattis.com/problems/bryr>
///
/// ![Kattis, bryr, sample 2](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_bryr_2.svg)
#[must_use]
pub fn kattis_bryr_2_isize() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 1), (3, 1)]),
        BTreeMap::from([(0, 1), (2, 1)]),
        BTreeMap::from([(1, 1), (3, 1)]),
        BTreeMap::from([(0, 1), (2, 1), (4, 1)]),
        BTreeMap::from([(3, 1), (5, 1)]),
        BTreeMap::from([(4, 1)]),
    ])
}

/// Arnar Bjarni Arnarson and Unnar Freyr Erlendsson. 2019. Bridges (Sample
/// Input 3). Kattis. <https://open.kattis.com/problems/bryr>
///
/// ![Kattis, bryr, sample 3](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_bryr_3.svg)
#[must_use]
pub fn kattis_bryr_3_usize() -> AdjacencyListWeighted<usize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(3, 0)]),
        BTreeMap::from([(7, 0), (9, 1)]),
        BTreeMap::from([(6, 0)]),
        BTreeMap::from([(0, 0), (4, 0), (5, 0), (7, 0)]),
        BTreeMap::from([(3, 0), (6, 1), (8, 1)]),
        BTreeMap::from([(3, 0), (6, 1), (8, 0)]),
        BTreeMap::from([(2, 0), (4, 1), (5, 1), (9, 1)]),
        BTreeMap::from([(1, 0), (3, 0)]),
        BTreeMap::from([(4, 1), (5, 0)]),
        BTreeMap::from([(1, 1), (2, 0), (6, 1)]),
    ])
}

/// Arnar Bjarni Arnarson and Unnar Freyr Erlendsson. 2019. Bridges (Sample
/// Input 3). Kattis. <https://open.kattis.com/problems/bryr>
///
/// ![Kattis, bryr, sample 3](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_bryr_3.svg)
#[must_use]
pub fn kattis_bryr_3_isize() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(3, 0)]),
        BTreeMap::from([(7, 0), (9, 1)]),
        BTreeMap::from([(6, 0)]),
        BTreeMap::from([(0, 0), (4, 0), (5, 0), (7, 0)]),
        BTreeMap::from([(3, 0), (6, 1), (8, 1)]),
        BTreeMap::from([(3, 0), (6, 1), (8, 0)]),
        BTreeMap::from([(2, 0), (4, 1), (5, 1), (9, 1)]),
        BTreeMap::from([(1, 0), (3, 0)]),
        BTreeMap::from([(4, 1), (5, 0)]),
        BTreeMap::from([(1, 1), (2, 0), (6, 1)]),
    ])
}

/// Karl Johan Sande Heimark. 2018. Cross Country. Kattis.
/// <https://open.kattis.com/problems/crosscountry>
///
/// ![Kattis, crosscountry, sample](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_crosscountry.svg)
#[must_use]
pub fn kattis_crosscountry_usize() -> AdjacencyListWeighted<usize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 1), (2, 3), (3, 14)]),
        BTreeMap::from([(0, 2), (2, 4), (3, 22)]),
        BTreeMap::from([(0, 3), (1, 10), (3, 7)]),
        BTreeMap::from([(0, 13), (1, 8), (2, 2)]),
    ])
}

/// Karl Johan Sande Heimark. 2018. Cross Country. Kattis.
/// <https://open.kattis.com/problems/crosscountry>
///
/// ![Kattis, crosscountry, sample](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_crosscountry.svg)
#[must_use]
pub fn kattis_crosscountry_isize() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 1), (2, 3), (3, 14)]),
        BTreeMap::from([(0, 2), (2, 4), (3, 22)]),
        BTreeMap::from([(0, 3), (1, 10), (3, 7)]),
        BTreeMap::from([(0, 13), (1, 8), (2, 2)]),
    ])
}

/// Per Austrin. 2005. Single source shortest path, non-negative weights.
/// Kattis. <https://open.kattis.com/problems/shortestpath1>
///
/// ![Kattis, shortestpath1, sample](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_shortestpath1.svg)
#[must_use]
pub fn kattis_shortestpath1_usize() -> AdjacencyListWeighted<usize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 2)]),
        BTreeMap::from([(2, 2)]),
        BTreeMap::new(),
        BTreeMap::from([(0, 2)]),
    ])
}

/// Per Austrin. 2005. Single source shortest path, non-negative weights.
/// Kattis. <https://open.kattis.com/problems/shortestpath1>
///
/// ![Kattis, shortestpath1, sample](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_shortestpath1.svg)
#[must_use]
pub fn kattis_shortestpath1_isize() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from([
        BTreeMap::from([(1, 2)]),
        BTreeMap::from([(2, 2)]),
        BTreeMap::new(),
        BTreeMap::from([(0, 2)]),
    ])
}

/// Per Austrin. 2005. Single source shortest path, negative weights.
/// Kattis. <https://open.kattis.com/problems/shortestpath3>
///
/// ![Kattis, shortestpath3, sample](https://raw.githubusercontent.com/bsdrks/graaf-images/main/out/kattis_shortestpath3.svg)
#[must_use]
pub fn kattis_shortestpath3() -> AdjacencyListWeighted<isize> {
    AdjacencyListWeighted::from(vec![
        BTreeMap::from([(1, 999), (3, 2)]),
        BTreeMap::from([(2, -2)]),
        BTreeMap::from([(1, 1)]),
        BTreeMap::new(),
        BTreeMap::new(),
    ])
}