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
64
65
66
67
68
69
70
71
72
73
74
75
76

use crate::adjacency_list_graph_with_edge_id_from_edges::*;

pub fn dfs_tree(
    n: usize,
    edges: &[(usize, usize)],
    root: usize,
) -> Vec<bool> {
    let m = edges.len();

    let mut used = vec![false; m];

    let mut visited = vec![false; m];

    fn dfs(
        g: &[Vec<(usize, usize)>],
        visited: &mut [bool],
        used: &mut [bool],
        u: usize,
    ) {
        visited[u] = true;

        for &(v, eid) in g[u].iter() {
            if visited[v] {
                continue;
            }

            used[eid] = true;

            dfs(g, visited, used, v);
        }
    }

    let g = graph_from_edges(n, edges, false);

    dfs(&g, &mut visited, &mut used, root);

    used
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let cases = vec![
            (
                (4, vec![(0, 1), (0, 3), (1, 2), (1, 3), (2, 3)]),
                vec![true, false, true, false, true],
            ),
            (
                (
                    6,
                    vec![
                        (0, 1),
                        (0, 3),
                        (0, 4),
                        (0, 5),
                        (1, 3),
                        (1, 5),
                        (2, 3),
                        (2, 4),
                    ],
                ),
                vec![true, false, false, false, true, true, true, true],
            ),
        ];

        for ((n, edges), ans) in cases {
            assert_eq!(dfs_tree(n, &edges, 0), ans);
        }
    }
}