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

use crate::undirected_lowlink::undirected_lowlink;

/// return edge ids.

pub fn find_bridges_lowlink(
    v_size: usize,
    undirected_edges: &[(usize, usize)],
) -> Vec<usize> {
    let lowlink = undirected_lowlink(v_size, undirected_edges);

    let order = lowlink.orders;

    let low = lowlink.low_orders;

    (0..undirected_edges.len())
        .filter(|&i| {
            let (mut u, mut v) = undirected_edges[i];

            if order[u] > order[v] {
                std::mem::swap(&mut u, &mut v);
            }

            low[v] == order[v]
        })
        .collect()
}

// TODO
#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}