path-finding 0.8.0

This library provides a variety of path finding and graph operations. Work in progress.
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150

pub struct UnionFind {
    sizes: Vec<usize>,
    ids: Vec<usize>,
    components: usize,
}

impl UnionFind {
    pub fn from(node_count: usize) -> UnionFind {
        let sizes = vec![1; node_count];
        let mut ids = Vec::with_capacity(node_count);
        let components = node_count;

        for i in 0..node_count {
            ids.push(i);
        }

        return UnionFind {
            sizes,
            ids,
            components,
        };
    }

    fn find(&mut self, mut p: usize) -> usize {
        let mut root = p;

        while root != self.ids[root] {
            root = self.ids[root];
        }

        while p != root {
            let next = self.ids[p];
            self.ids[p] = root;
            p = next;
        }

        return root;
    }

    pub fn connected(&mut self, p: usize, q: usize) -> bool {
        return self.find(p) == self.find(q);
    }

    pub fn unify(&mut self, p: usize, q: usize) {
        let p_root = self.find(p);
        let q_root = self.find(q);

        if p_root == q_root {
            return;
        }

        if self.sizes[p_root] < self.sizes[q_root] {
            self.sizes[q_root] += self.sizes[p_root];
            self.ids[p_root] = self.ids[q_root];
        } else {
            self.sizes[p_root] += self.sizes[q_root];
            self.ids[q_root] = self.ids[p_root];
        }

        self.components -= 1;
    }

    pub fn size(&self, id: usize) -> usize {
        return self.sizes[id];
    }

    pub fn parent(&self, id: usize) -> usize {
        return self.ids[id];
    }
}

#[test]
fn union_find_with_zero_edges_should_succeed() {
    let union_find = UnionFind::from(0);

    assert_eq!(0, union_find.components)
}

#[test]
fn unify_should_decrease_components() {
    let mut union_find = UnionFind::from(2);

    assert_eq!(2, union_find.components);

    union_find.unify(0, 1);
    assert_eq!(1, union_find.components);
    assert_eq!(2, union_find.size(0));
    assert_eq!(0, union_find.parent(1));
}

#[test]
fn test_find() {
    let mut union_find = UnionFind::from(5);
    union_find.unify(0, 1);
    union_find.unify(1, 2);

    assert_eq!(0, union_find.find(2));
}

#[test]
fn test_connected() {
    let mut union_find = UnionFind::from(5);
    union_find.unify(0, 1);
    union_find.unify(3, 4);

    assert!(union_find.connected(0, 1));
    assert!(union_find.connected(3, 4));
    assert!(!union_find.connected(0, 4));
}

#[test]
fn test_unify() {
    let mut union_find = UnionFind::from(4);
    union_find.unify(0, 1);

    assert_eq!(2, union_find.size(0));
    assert_eq!(1, union_find.size(1));
    assert_eq!(1, union_find.size(2));
    assert_eq!(1, union_find.size(3));
}

#[test]
fn test_unify_multiple_groups() {
    let mut union_find = UnionFind::from(6);
    union_find.unify(0, 1);
    union_find.unify(1, 2);
    union_find.unify(3, 4);

    assert_eq!(3, union_find.size(0));
    assert_eq!(1, union_find.size(1));
    assert_eq!(1, union_find.size(2));
    assert_eq!(2, union_find.size(3));
    assert_eq!(1, union_find.size(4));
    assert_eq!(1, union_find.size(5));
}

#[test]
fn test_components() {
    let mut union_find = UnionFind::from(5);
    assert_eq!(5, union_find.components);

    union_find.unify(0, 1);
    assert_eq!(4, union_find.components);

    union_find.unify(1, 2);
    assert_eq!(3, union_find.components);

    union_find.unify(3, 4);
    assert_eq!(2, union_find.components);
}