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

pub fn bfs<F, H>(
    g: &[Vec<usize>],
    mut f: F,
    mut h: H,
) where
    F: FnMut(usize, usize),
    H: FnMut(usize),
{
    let n = g.len();

    let mut in_deg = vec![0; n];

    for u in 0..n {
        for &v in g[u].iter() {
            in_deg[v] += 1;
        }
    }

    let mut que = std::collections::VecDeque::new();

    for i in 0..n {
        if in_deg[i] == 0 {
            que.push_back(i);
        }
    }

    while let Some(u) = que.pop_front() {
        h(u);

        for &v in g[u].iter() {
            f(u, v);

            in_deg[v] -= 1;

            if in_deg[v] == 0 {
                que.push_back(v);
            }
        }
    }
}

#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}