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

use crate::{
    union_find_low_memory_with_trait::UnionFind,
    union_find_traits::*,
};

pub fn has_cycle(
    v_size: usize,
    edges: &[(usize, usize)],
) -> bool {
    let mut uf = UnionFind::new(v_size);

    for &(u, v) in edges.iter() {
        if uf.same(u, v) {
            return true;
        }

        uf.unite(u, v);
    }

    false
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

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