dsalgo 0.3.10

A package for Datastructures and Algorithms.
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

#[derive(Debug)]

pub struct AdjacencyMatrix<T> {
    pub(crate) data: Vec<Vec<T>>,
}

impl<T> AdjacencyMatrix<T> {
    pub fn size(&self) -> usize {
        self.data.len()
    }

    pub fn data(&self) -> &[Vec<T>] {
        &self.data
    }

    pub fn new(size: usize) -> Self
    where
        T: Default,
    {
        Self {
            data: (0..size)
                .map(|_| (0..size).map(|_| T::default()).collect())
                .collect(),
        }
    }

    pub fn add_node(&mut self)
    where
        T: Default,
    {
        self.data.push((0..self.size()).map(|_| T::default()).collect());

        for i in 0..self.size() {
            self.data[i].push(T::default());
        }
    }
}

impl<T> std::ops::Index<(usize, usize)> for AdjacencyMatrix<T> {
    type Output = T;

    fn index(
        &self,
        (u, v): (usize, usize),
    ) -> &Self::Output {
        &self.data[u][v]
    }
}

impl<T> std::ops::IndexMut<(usize, usize)> for AdjacencyMatrix<T> {
    fn index_mut(
        &mut self,
        (u, v): (usize, usize),
    ) -> &mut Self::Output {
        &mut self.data[u][v]
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let mut g = AdjacencyMatrix::new(5);

        g[(0, 0)] = 1;

        dbg!(&g);
    }
}