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

pub trait Root {
    fn root(
        &mut self,
        u: usize,
    ) -> usize;
}

#[allow(private_in_public)]

pub trait Size {
    fn size(&self) -> usize;
}

pub trait Unite {
    fn unite(
        &mut self,
        u: usize,
        v: usize,
    );
}

/// size of the component containing the node

pub trait SizeOf {
    fn size_of(
        &mut self,
        u: usize,
    ) -> usize;
}

pub trait Same {
    fn same(
        &mut self,
        u: usize,
        v: usize,
    ) -> bool;
}

impl<U: Root> Same for U {
    fn same(
        &mut self,
        u: usize,
        v: usize,
    ) -> bool {
        self.root(u) == self.root(v)
    }
}

pub trait Labels {
    fn labels(&mut self) -> Vec<usize>;
}

impl<U: Root + Size> Labels for U {
    /// same label -> same component.

    fn labels(&mut self) -> Vec<usize> {
        let n = self.size();

        let mut lb = vec![n; n];

        let mut l = 0;

        for i in 0..n {
            let r = self.root(i);

            if lb[r] == n {
                lb[r] = l;

                l += 1;
            }

            lb[i] = lb[r];
        }

        lb
    }
}