genetic_algorithm_tsp/
lib.rs

1#![deny(rustdoc::missing_doc_code_examples)]
2#![deny(missing_docs)]
3//! # Genetic algorithms for solving TSPs.
4//!
5//! This crates contains utitlities to run genetic algorithms and solve Traveling Salesman Problems.
6
7/// Represent a distance Matrix as a Vec<Vec<f64>>.
8pub mod distance_mat;
9/// The `route`-module contains the `Route`-class, the individual element of the TSP that implements
10/// important methods like `crossover` or `mutate`.
11pub mod route;
12/// The `routes`-module contains the main class of this crate which is the `Routes`-class that contains
13/// your current subset of routes and with which you can evolve them.
14pub mod routes;
15/// The `subsequence`-module contains a helper function, `Subsequence` that gives you functionality to select elements
16/// before, in and after a subsequence of a Vector. It is used extensively in the `ordered_crossover`-function.
17mod subsequence;
18/// the `test-utils`-module contains utitlities for testing and include for example the construction of test-data
19/// or the comparison of specializied objects (like permutations).
20mod test_utils;
21/// The `utils`-module contains utility that are used throughout the rest of the code base. The underlying `ordered_crossover`-
22/// function is implemented here.
23mod utils;
genetic_algorithm_tsp/lib.rs

genetic_algorithm_tsp/
lib.rs
