dogs 1.3.0

Discrete Optimization Global Search framework. Implements various search algorithms that can be found in combinatorial optimization or heuristic search.
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

use std::cmp::Ordering;

/**
implements a guided node.
 - implements the Ord trait for nodes using the guide method from the search space)
 - fast guidance computation if the underlying search-space does not explicitely stores the guide
*/
#[derive(Debug)]
pub struct GuidedNode<N, G:Ord> {
    /// underlying node
    pub node: N,
    /// guide of the node
    pub guide: G,
}

impl<N, G:Ord> GuidedNode<N, G> {
    /**
    builds a GuidedNode from the node and its guide value
    */
    pub fn new(n:N, g:G) -> Self { GuidedNode { node:n, guide:g } }
}

impl<N, G:Ord> Ord for GuidedNode<N, G> {
    fn cmp(&self, other: &Self) -> Ordering { self.guide.cmp(&other.guide) }
}

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

impl<N, G:Ord> PartialEq for GuidedNode<N, G> {
    fn eq(&self, other: &Self) -> bool { self.guide.eq(&other.guide) }
}

impl<N, G:Ord> Eq for GuidedNode<N, G> {}