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

/// return (parents, depths)

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

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

    p[root] = root;

    let mut d = vec![0; n];

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

    que.push_back(root);

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

            p[v] = u;

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

            que.push_back(v);
        }
    }

    (p, d)
}