hercules 0.5.0

A Heuristics toolbox for QUBO in Rust
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 ndarray::Array1;
use std::cmp::Ordering;
use std::collections::HashMap;

/// Struct the describes the branch and bound tree nodes
#[derive(Clone)]
pub struct QuboBBNode {
    pub lower_bound: f64,
    pub solution: Array1<f64>,
    pub fixed_variables: HashMap<usize, usize>,
}

impl Eq for QuboBBNode {}

impl PartialEq<Self> for QuboBBNode {
    fn eq(&self, other: &Self) -> bool {
        self.fixed_variables == other.fixed_variables
    }
}

impl PartialOrd<Self> for QuboBBNode {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl Ord for QuboBBNode {
    fn cmp(&self, other: &Self) -> Ordering {
        other.lower_bound.partial_cmp(&self.lower_bound).unwrap()
    }
}