clarabel 0.11.1

Clarabel Conic Interior Point Solver for Rust / Python
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

// disjoint set union type for clique graph merge
// See: https://www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/UnionFind-2x2.pdf

#[derive(Debug)]
pub(crate) struct DisjointSetUnion {
    parents: Vec<usize>,
    ranks: Vec<usize>,
}

impl DisjointSetUnion {
    pub(crate) fn new(n: usize) -> Self {
        Self {
            parents: (0..n).collect(),
            ranks: vec![0; n],
        }
    }

    pub(crate) fn union(&mut self, x: usize, y: usize) {
        let r = self.root(x);
        let s = self.root(y);

        if r == s {
            return;
        }

        match self.ranks[r].cmp(&self.ranks[s]) {
            std::cmp::Ordering::Greater => {
                self.parents[s] = r;
            }
            std::cmp::Ordering::Less => {
                self.parents[r] = s;
            }
            std::cmp::Ordering::Equal => {
                self.parents[r] = s;
                self.ranks[s] += 1;
            }
        }
    }

    pub(crate) fn in_same_set(&mut self, x: usize, y: usize) -> bool {
        self.root(x) == self.root(y)
    }

    fn root(&mut self, x: usize) -> usize {
        let mut parent = x;
        while parent != self.parents[x] {
            self.parents[x] = self.parents[self.parents[x]]; //path compression
            parent = self.parents[x];
        }
        parent
    }
}

#[test]
fn test_union() {
    // basic union operations
    let mut dsu = DisjointSetUnion::new(5);
    dsu.union(0, 1);
    dsu.union(2, 3);
    dsu.union(1, 2);
    assert!(dsu.in_same_set(0, 2));
    assert!(dsu.in_same_set(1, 3));
    assert!(dsu.in_same_set(0, 3));
    assert!(!dsu.in_same_set(4, 2));

    // entry union with itself
    let mut dsu = DisjointSetUnion::new(5);
    dsu.union(0, 0);
    assert!(dsu.in_same_set(0, 0));

    // Test union with larger set
    let mut dsu = DisjointSetUnion::new(10);
    dsu.union(0, 1);
    dsu.union(2, 3);
    dsu.union(1, 2);
    dsu.union(0, 4);
    dsu.union(5, 6);
    dsu.union(7, 8);
    dsu.union(4, 6);
    dsu.union(3, 8);
    assert!(dsu.in_same_set(0, 6));
    assert!(dsu.in_same_set(2, 7));
    assert!(dsu.in_same_set(3, 4));
}

#[test]
fn test_in_same_set() {
    // Test elements in the same set
    let mut dsu = DisjointSetUnion::new(5);
    dsu.union(0, 1);
    assert!(dsu.in_same_set(0, 1));
    assert!(dsu.in_same_set(1, 0));

    // Test elements not in the same set
    assert!(!dsu.in_same_set(0, 2));
    assert!(!dsu.in_same_set(3, 4));
}

#[test]
fn test_root() {
    // Test finding root elements
    let mut dsu = DisjointSetUnion::new(5);
    dsu.union(0, 1);
    assert_eq!(dsu.root(1), dsu.root(0));
    assert_eq!(dsu.root(3), 3);

    // Test finding root with larger set
    let mut dsu = DisjointSetUnion::new(10);
    dsu.union(0, 1);
    dsu.union(2, 3);
    dsu.union(1, 2);
    let common = dsu.root(2);
    assert_eq!(dsu.root(0), common);
    assert_eq!(dsu.root(1), common);
    assert_eq!(dsu.root(2), common);
    assert_eq!(dsu.root(3), common);
    assert_eq!(dsu.root(4), 4);
}