arion 0.5.0

Solver and Local search operators for vehicle routing problems
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

use std::cmp::Ordering;

#[derive(Debug, Clone)]
pub struct Location {
    pub(crate) x: f32,
    pub(crate) y: f32,
    pub demand: i64, 
}


impl Location { 
    pub fn new(x:f32, y:f32, demand: i64) -> Self { 
        Location {
            x, 
            y,
            demand
        }
    }
}


impl Ord for Location { 
    fn cmp(&self, other: &Self) -> Ordering {
        self.demand.cmp(&other.demand)
    }
}

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

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

impl Eq for Location {}