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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94

use crate::undirected_lowlink::undirected_lowlink;

/// return vertex ids.

pub fn find_articulation_points_lowlink(
    v_size: usize,
    undirected_edges: &[(usize, usize)],
) -> Vec<usize> {
    let mut articulation_points = Vec::new();

    let lowlink = undirected_lowlink(v_size, undirected_edges);

    let order = lowlink.orders;

    let low = lowlink.low_orders;

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

    let mut g = vec![vec![]; v_size];

    for &(u, v) in undirected_edges {
        g[u].push(v);

        g[v].push(u);
    }

    fn find(
        g: &[Vec<usize>],
        order: &[usize],
        low: &[usize],
        points: &mut Vec<usize>,
        visited: &mut Vec<bool>,
        u: usize,
        parent: usize,
    ) {
        let n = g.len();

        visited[u] = true;

        let mut childs_count = 0;

        let mut is_articulation = false;

        for &v in &g[u] {
            if visited[v] {
                continue;
            }

            childs_count += 1;

            find(g, order, low, points, visited, v, u);

            if parent != n && low[v] >= order[u] {
                is_articulation = true;
            }
        }

        if parent == n && childs_count > 1 {
            is_articulation = true;
        }

        if is_articulation {
            points.push(u);
        }
    }

    for i in 0..v_size {
        if visited[i] {
            continue;
        }

        find(
            &g,
            &order,
            &low,
            &mut articulation_points,
            &mut visited,
            i,
            v_size,
        );
    }

    articulation_points
}

// TODO
#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}