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

pub fn bfs_level(
    g: &[Vec<usize>],
    src: usize,
) -> Vec<usize> {
    let n = g.len();

    let mut lv = vec![n; n];

    let mut que = std::collections::VecDeque::new();

    que.push_back(src);

    lv[src] = 0;

    while let Some(u) = que.pop_front() {
        for &v in g[u].iter() {
            if lv[v] != n {
                continue;
            }

            lv[v] = lv[u] + 1;

            que.push_back(v);
        }
    }

    lv
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let cases = vec![(
            vec![vec![1, 2], vec![0, 3], vec![0, 3], vec![1, 2]],
            0,
            vec![0, 1, 1, 2],
        )];

        for (g, src, ans) in cases {
            assert_eq!(bfs_level(&g, src), ans);
        }
    }
}