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
50
51
52
53
54
55
56
57
58
59
60
61
62
63

use crate::tree_bfs_parent_depth::bfs;

pub struct TreePath {
    parent: Vec<usize>,
    depth: Vec<usize>,
}

impl TreePath {
    pub fn new(g: &[Vec<usize>]) -> Self {
        let (parent, depth) = bfs(g, 0);

        Self { parent, depth }
    }

    pub fn get(
        &self,
        mut u: usize,
        mut v: usize,
    ) -> Vec<usize> {
        let mut l = vec![];

        let mut r = vec![];

        while u != v {
            if self.depth[u] >= self.depth[v] {
                l.push(u);

                u = self.parent[u];
            }

            if self.depth[v] > self.depth[u] {
                r.push(v);

                v = self.parent[v];
            }
        }

        l.push(u);

        r.reverse();

        l.append(&mut r);

        l
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

        let f = TreePath::new(&g);

        assert_eq!(f.get(4, 2), [4, 3, 1, 2]);
    }
}