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

pub fn tree_bfs_depth(
    adjacency_list: Vec<Vec<usize>>,
    root: usize,
) -> Vec<usize> {
    let g = adjacency_list;

    let n = g.len();

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

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

    que.push_back((root, root));

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

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

            que.push_back((v, u));
        }
    }

    d
}