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

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

    let mut tour = Vec::with_capacity(2 * n - 1);

    fn dfs(
        g: &[Vec<usize>],
        tour: &mut Vec<usize>,
        u: usize,
        p: usize,
    ) {
        tour.push(u);

        for &v in g[u].iter() {
            if v == p {
                continue;
            }

            dfs(g, tour, v, u);

            tour.push(u);
        }
    }

    dfs(g, &mut tour, root, n);

    tour
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

        assert_eq!(euler_tour_nodes(&g, 0), [0, 1, 3, 1, 0, 2, 0]);
    }
}