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

use crate::union_find_low_memory::UnionFind;

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

    for &(u, v) in edges {
        uf.unite(u, v);
    }

    uf.labels()
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let n = 3;

        let edges = vec![(0, 1)];

        assert_eq!(connected_components(n, &edges), [0, 0, 1]);
    }
}