genetic-algorithm-tsp 0.1.3

Using genetic algorithms to solve Traveling salesman 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
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

use crate::distance_mat::DistanceMat;
use core::hash;
use std::collections::HashSet;

/// Get the test matrix that should be use tests.
///
pub fn test_dist_mat() -> DistanceMat {
    // TODO: Either this matrix should be four dimensional
    // or there should also be a four dimensional matrix.
    DistanceMat::new(vec![
        vec![0.0, 1.0, 2.0],
        vec![1.0, 0.0, 3.0],
        vec![2.0, 3.0, 0.0],
    ])
}
/// Test if a sequence is a valid permutation for another sequence.
///
/// Permuation means that it consists exactly all elements from the
/// or original sequence (both have same lenght) but potentially in
/// a different order.
///
/// # Arguments
///
/// * `sequence` - The actual sequence
/// * `permutation` - The potential permutation of the original sequence that should be tested.
///
pub fn valid_permutation<T>(sequence: &[T], permutation: &[T])
where
    T: Clone + Eq + hash::Hash,
{
    // If ..
    // - the two sequences have the same length
    // - sequence is a superset of permutation
    // - permutation is a superset of sequence
    // Then permutation is a valid permutation of sequence.
    assert_eq!(sequence.len(), permutation.len());
    assert!(sequence
        .iter()
        .cloned()
        .collect::<HashSet<T>>()
        .is_superset(&permutation.iter().cloned().collect::<HashSet<T>>()));
    assert!(permutation
        .iter()
        .cloned()
        .collect::<HashSet<T>>()
        .is_superset(&sequence.iter().cloned().collect::<HashSet<T>>()));
}

#[cfg(test)]
mod tests {
    use super::*;
    mod test_valid_permutation {
        use super::*;
        #[test]
        fn same_subsequence() {
            valid_permutation(&vec![1, 2, 3], &vec![1, 2, 3]);
        }
        #[test]
        fn actual_permuation() {
            valid_permutation(&vec![1, 2, 3], &vec![3, 1, 2]);
        }
        #[test]
        #[should_panic]
        fn invalid_permuation_too_many() {
            valid_permutation(&vec![1, 2, 3], &vec![3, 1, 2, 3]);
        }
        #[test]
        #[should_panic]
        fn invalid_permuation_too_few() {
            valid_permutation(&vec![1, 2, 3], &vec![3, 1]);
        }
        #[test]
        #[should_panic]
        fn invalid_permuation_wrong_elem() {
            valid_permutation(&vec![1, 2, 3], &vec![3, 1, 4]);
        }
    }
}