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

use crate::tree_edges_to_graph::tree_edges_to_graph;

pub fn tree_dfs<T, F>(
    tree_edges: &[(usize, usize)],
    root: usize,
    default_data: Vec<T>,
    mut assign: F,
) -> Vec<T>
where
    F: FnMut(&mut Vec<T>, usize, usize),
{
    let graph = tree_edges_to_graph(tree_edges);

    let n = graph.len();

    assert!(default_data.len() == n);

    let mut parent = vec![None; n];

    let mut data = default_data;

    let mut stack: Vec<isize> = Vec::new();

    stack.push(root as isize);

    while let Some(u) = stack.pop() {
        if u < 0 {
            let u = !u as usize;

            if let Some(p) = parent[u] {
                assign(&mut data, p, u);
            }

            continue;
        }

        stack.push(!u);

        let u = u as usize;

        for &v in graph[u].iter() {
            if Some(v) == parent[u] {
                continue;
            }

            parent[v] = Some(u);

            stack.push(v as isize);
        }
    }

    data
}

#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}