gryf 0.2.1

Graph data structure library with focus on convenience, versatility, correctness and performance.
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

use std::{
    iter::{Enumerate, Zip},
    marker::PhantomData,
    ops::Range,
    slice::Iter,
};

use crate::core::{
    base::{EdgeRef, VertexRef},
    id::{IdPair, IdType, IntegerIdType},
    marker::EdgeType,
};

#[derive(Debug, Clone, PartialEq, Eq)]
pub struct AdjVertex<Id: IdPair, V> {
    pub attr: V,
    pub edges: [Vec<Id::EdgeId>; 2],
}

impl<Id: IdPair, V> AdjVertex<Id, V> {
    pub fn new(attr: V) -> Self {
        Self {
            attr,
            edges: [Vec::new(), Vec::new()],
        }
    }
}

#[derive(Debug)]
pub struct RangeIds<I: IntegerIdType> {
    range: Range<usize>,
    ty: PhantomData<I>,
}

impl<I: IntegerIdType> Iterator for RangeIds<I> {
    type Item = I;

    fn next(&mut self) -> Option<Self::Item> {
        self.range.next().map(I::from_usize)
    }
}

impl<I: IntegerIdType> From<Range<usize>> for RangeIds<I> {
    fn from(range: Range<usize>) -> Self {
        Self {
            range,
            ty: PhantomData,
        }
    }
}

pub struct VerticesIter<'a, Id, V> {
    inner: Enumerate<Iter<'a, V>>,
    ty: PhantomData<fn() -> Id>,
}

impl<'a, Id, V> VerticesIter<'a, Id, V> {
    pub fn new(inner: Iter<'a, V>) -> Self {
        Self {
            inner: inner.enumerate(),
            ty: PhantomData,
        }
    }
}

impl<'a, Id: IdPair, V> Iterator for VerticesIter<'a, Id, V>
where
    Id::VertexId: IntegerIdType,
{
    type Item = VertexRef<'a, Id::VertexId, V>;

    fn next(&mut self) -> Option<Self::Item> {
        self.inner.next().map(|(id, vertex)| VertexRef {
            id: IdType::from_usize(id),
            attr: vertex,
        })
    }
}

pub struct AdjVerticesIter<'a, Id: IdPair, V> {
    inner: Enumerate<Iter<'a, AdjVertex<Id, V>>>,
}

impl<'a, Id: IdPair, V> AdjVerticesIter<'a, Id, V> {
    pub fn new(inner: Iter<'a, AdjVertex<Id, V>>) -> Self {
        Self {
            inner: inner.enumerate(),
        }
    }
}

impl<'a, Id: IdPair, V> Iterator for AdjVerticesIter<'a, Id, V>
where
    Id::VertexId: IntegerIdType,
{
    type Item = VertexRef<'a, Id::VertexId, V>;

    fn next(&mut self) -> Option<Self::Item> {
        self.inner.next().map(|(id, vertex)| VertexRef {
            id: IdType::from_usize(id),
            attr: &vertex.attr,
        })
    }
}

pub struct EdgesIter<'a, Id: IdPair, E> {
    #[allow(clippy::type_complexity)]
    inner: Enumerate<Zip<Iter<'a, E>, Iter<'a, [Id::VertexId; 2]>>>,
}

impl<'a, Id: IdPair, E> EdgesIter<'a, Id, E> {
    pub fn new(edges: Iter<'a, E>, endpoints: Iter<'a, [Id::VertexId; 2]>) -> Self {
        Self {
            inner: edges.zip(endpoints).enumerate(),
        }
    }
}

impl<'a, Id: IdPair, E> Iterator for EdgesIter<'a, Id, E>
where
    Id::VertexId: IntegerIdType,
    Id::EdgeId: IntegerIdType,
{
    type Item = EdgeRef<'a, Id::VertexId, Id::EdgeId, E>;

    fn next(&mut self) -> Option<Self::Item> {
        self.inner.next().map(|(index, (attr, endpoints))| EdgeRef {
            id: IdType::from_usize(index),
            attr,
            from: endpoints[0],
            to: endpoints[1],
        })
    }
}

pub fn connect_vertices<Ty: EdgeType>(vertex_count: usize, mut connect: impl FnMut(usize, usize)) {
    for i in 0..vertex_count {
        // Self-loops are considered too.
        let begin = if Ty::is_directed() { 0 } else { i };
        for j in begin..vertex_count {
            connect(i, j);
        }
    }
}