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
/// parent of root := root
pub fn tree_bfs_parent(
g: &[Vec<usize>],
root: usize,
) -> Vec<usize> {
let n = g.len();
let mut parent = vec![n; n];
parent[root] = root;
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 == parent[u] {
continue;
}
parent[v] = u;
que.push_back(v);
}
}
parent
}
#[cfg(test)]
mod tests {
#[test]
fn test() {}
}