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
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
pub use self::filter::*;
pub use self::reversed::*;
#[macro_use]
mod macros;
mod dfsvisit;
mod traversal;
pub use self::dfsvisit::*;
pub use self::traversal::*;
use fixedbitset::FixedBitSet;
use std::collections::HashSet;
use std::hash::{BuildHasher, Hash};
use super::EdgeType;
use crate::prelude::Direction;
use crate::graph::IndexType;
trait_template! {
pub trait GraphBase {
@escape [type NodeId]
@escape [type EdgeId]
@section nodelegate
type EdgeId: Copy + PartialEq;
type NodeId: Copy + PartialEq;
}
}
GraphBase! {delegate_impl []}
GraphBase! {delegate_impl [['a, G], G, &'a mut G, deref]}
pub trait GraphRef: Copy + GraphBase {}
impl<'a, G> GraphRef for &'a G where G: GraphBase {}
trait_template! {
pub trait IntoNeighbors : GraphRef {
@section type
type Neighbors: Iterator<Item=Self::NodeId>;
@section self
fn neighbors(self, a: Self::NodeId) -> Self::Neighbors;
}
}
IntoNeighbors! {delegate_impl []}
trait_template! {
pub trait IntoNeighborsDirected : IntoNeighbors {
@section type
type NeighborsDirected: Iterator<Item=Self::NodeId>;
@section self
fn neighbors_directed(self, n: Self::NodeId, d: Direction)
-> Self::NeighborsDirected;
}
}
trait_template! {
pub trait IntoEdges : IntoEdgeReferences + IntoNeighbors {
@section type
type Edges: Iterator<Item=Self::EdgeRef>;
@section self
fn edges(self, a: Self::NodeId) -> Self::Edges;
}
}
IntoEdges! {delegate_impl []}
trait_template! {
pub trait IntoEdgesDirected : IntoEdges + IntoNeighborsDirected {
@section type
type EdgesDirected: Iterator<Item=Self::EdgeRef>;
@section self
fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected;
}
}
IntoEdgesDirected! {delegate_impl []}
trait_template! {
pub trait IntoNodeIdentifiers : GraphRef {
@section type
type NodeIdentifiers: Iterator<Item=Self::NodeId>;
@section self
fn node_identifiers(self) -> Self::NodeIdentifiers;
}
}
IntoNodeIdentifiers! {delegate_impl []}
IntoNeighborsDirected! {delegate_impl []}
trait_template! {
pub trait Data : GraphBase {
@section type
type NodeWeight;
type EdgeWeight;
}
}
Data! {delegate_impl []}
Data! {delegate_impl [['a, G], G, &'a mut G, deref]}
pub trait EdgeRef: Copy {
type NodeId;
type EdgeId;
type Weight;
fn source(&self) -> Self::NodeId;
fn target(&self) -> Self::NodeId;
fn weight(&self) -> &Self::Weight;
fn id(&self) -> Self::EdgeId;
}
impl<'a, N, E> EdgeRef for (N, N, &'a E)
where
N: Copy,
{
type NodeId = N;
type EdgeId = (N, N);
type Weight = E;
fn source(&self) -> N {
self.0
}
fn target(&self) -> N {
self.1
}
fn weight(&self) -> &E {
self.2
}
fn id(&self) -> (N, N) {
(self.0, self.1)
}
}
pub trait NodeRef: Copy {
type NodeId;
type Weight;
fn id(&self) -> Self::NodeId;
fn weight(&self) -> &Self::Weight;
}
trait_template! {
pub trait IntoNodeReferences : Data + IntoNodeIdentifiers {
@section type
type NodeRef: NodeRef<NodeId=Self::NodeId, Weight=Self::NodeWeight>;
type NodeReferences: Iterator<Item=Self::NodeRef>;
@section self
fn node_references(self) -> Self::NodeReferences;
}
}
IntoNodeReferences! {delegate_impl []}
impl<Id> NodeRef for (Id, ())
where
Id: Copy,
{
type NodeId = Id;
type Weight = ();
fn id(&self) -> Self::NodeId {
self.0
}
fn weight(&self) -> &Self::Weight {
static DUMMY: () = ();
&DUMMY
}
}
impl<'a, Id, W> NodeRef for (Id, &'a W)
where
Id: Copy,
{
type NodeId = Id;
type Weight = W;
fn id(&self) -> Self::NodeId {
self.0
}
fn weight(&self) -> &Self::Weight {
self.1
}
}
trait_template! {
pub trait IntoEdgeReferences : Data + GraphRef {
@section type
type EdgeRef: EdgeRef<NodeId=Self::NodeId, EdgeId=Self::EdgeId,
Weight=Self::EdgeWeight>;
type EdgeReferences: Iterator<Item=Self::EdgeRef>;
@section self
fn edge_references(self) -> Self::EdgeReferences;
}
}
IntoEdgeReferences! {delegate_impl [] }
trait_template! {
pub trait GraphProp : GraphBase {
@section type
type EdgeType: EdgeType;
@section nodelegate
fn is_directed(&self) -> bool {
<Self::EdgeType>::is_directed()
}
}
}
GraphProp! {delegate_impl []}
trait_template! {
#[allow(clippy::needless_arbitrary_self_type)]
pub trait NodeIndexable : GraphBase {
@section self
fn node_bound(self: &Self) -> usize;
fn to_index(self: &Self, a: Self::NodeId) -> usize;
fn from_index(self: &Self, i: usize) -> Self::NodeId;
}
}
NodeIndexable! {delegate_impl []}
trait_template! {
#[allow(clippy::needless_arbitrary_self_type)]
pub trait EdgeIndexable : GraphBase {
@section self
fn edge_bound(self: &Self) -> usize;
fn to_index(self: &Self, a: Self::EdgeId) -> usize;
fn from_index(self: &Self, i: usize) -> Self::EdgeId;
}
}
EdgeIndexable! {delegate_impl []}
trait_template! {
#[allow(clippy::needless_arbitrary_self_type)]
pub trait NodeCount : GraphBase {
@section self
fn node_count(self: &Self) -> usize;
}
}
NodeCount! {delegate_impl []}
trait_template! {
pub trait NodeCompactIndexable : NodeIndexable + NodeCount { }
}
NodeCompactIndexable! {delegate_impl []}
pub trait VisitMap<N> {
fn visit(&mut self, a: N) -> bool;
fn is_visited(&self, a: &N) -> bool;
}
impl<Ix> VisitMap<Ix> for FixedBitSet
where
Ix: IndexType,
{
fn visit(&mut self, x: Ix) -> bool {
!self.put(x.index())
}
fn is_visited(&self, x: &Ix) -> bool {
self.contains(x.index())
}
}
impl<N, S> VisitMap<N> for HashSet<N, S>
where
N: Hash + Eq,
S: BuildHasher,
{
fn visit(&mut self, x: N) -> bool {
self.insert(x)
}
fn is_visited(&self, x: &N) -> bool {
self.contains(x)
}
}
trait_template! {
#[allow(clippy::needless_arbitrary_self_type)]
pub trait Visitable : GraphBase {
@section type
type Map: VisitMap<Self::NodeId>;
@section self
fn visit_map(self: &Self) -> Self::Map;
fn reset_map(self: &Self, map: &mut Self::Map);
}
}
Visitable! {delegate_impl []}
trait_template! {
#[allow(clippy::needless_arbitrary_self_type)]
pub trait GetAdjacencyMatrix : GraphBase {
@section type
type AdjMatrix;
@section self
fn adjacency_matrix(self: &Self) -> Self::AdjMatrix;
fn is_adjacent(self: &Self, matrix: &Self::AdjMatrix, a: Self::NodeId, b: Self::NodeId) -> bool;
}
}
GetAdjacencyMatrix! {delegate_impl []}
trait_template! {
#[allow(clippy::needless_arbitrary_self_type)]
pub trait EdgeCount : GraphBase {
@section self
fn edge_count(self: &Self) -> usize;
}
}
EdgeCount! {delegate_impl []}
mod filter;
mod reversed;