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
/// it should be satisfied that parent[root] = root
pub fn restore_tree_path(
parent: &[usize],
mut v: usize,
) -> Vec<usize> {
let mut path = Vec::new();
loop {
path.push(v);
let p = parent[v];
if p == v {
break;
}
v = p;
}
path.reverse();
path
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test() {
let cases = vec![(
(
vec![
vec![1],
vec![0, 2],
vec![1, 3, 4],
vec![2],
vec![2, 5],
vec![4],
],
0,
),
(5, vec![0, 1, 2, 4, 5]),
)];
use crate::tree_bfs_parent::tree_bfs_parent;
for ((g, root), (v, ans)) in cases {
let p = tree_bfs_parent(&g, root);
assert_eq!(restore_tree_path(&p, v), ans);
}
}
}