genx 0.4.0

An easy to use and modular genetic algorithms library.
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

use std::collections::HashSet;

pub mod single_point;

pub mod multi_point;

pub mod shuffle;

pub mod uniform;

pub mod partially_mapped;

pub mod order;

pub mod cycle;

pub mod linear;

pub mod blend;

pub mod simulated_binary;

pub mod uniform_partially_mapped;

pub use self::single_point::single_point_crossover;

pub use self::multi_point::multi_point_crossover;

pub use self::shuffle::shuffle_crossover;

pub use self::uniform::uniform_crossover;

pub use self::partially_mapped::partially_mapped_crossover;

pub use self::order::order_crossover;

pub use self::cycle::cycle_crossover;

pub use self::linear::linear_crossover;

pub use self::blend::blend_crossover;

pub use self::simulated_binary::simulated_binary_crossover;

pub use self::uniform_partially_mapped::uniform_partially_mapped_crossover;

fn check_continuous(vec: &Vec<usize>) -> bool {
  let n = vec.len();
  let mut set:HashSet<usize> = HashSet::new();
  for x in vec.iter() {
    set.insert(*x);
    if *x >= n {
      return false;
    }
  }

  set.len() == vec.len()
}

fn check_length<T>(parent1 : &Vec<T>, parent2 : &Vec<T>) {
  if parent1.len() != parent2.len() {
    panic!("Vectors must be the same length");
  }
}