rapid_solve 0.1.7

This library provides a metaheuristic framework for solving combinatorial optimization 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

//! This module provides the [`Neighborhood`] trait which is used to define a local search
//! neighborhood.

use rayon::iter::ParallelIterator;

/// A local search neighborhood that provides for each solution an iterator over all neighbors.
/// The provided `current_solution`, as well as the [`Neighborhood`] instance must live as long as the iterator.
/// (Note that the iterator highly depends on the `current_solution` and that the [`Neighborhood`] may
/// have some attributes which goes into the iterator.)
pub trait Neighborhood<S>: Send + Sync {
    /// Returns an iterator over all neighbors of `current_solution`.
    fn neighbors_of<'a>(
        &'a self,
        current_solution: &'a S,
    ) -> Box<dyn Iterator<Item = S> + Send + Sync + 'a>;
}

/// A parallel local search neighborhood that provides for each solution an [`ParallelIterator`] over all
/// neighbors.
/// The provided `current_solution`, as well as the [`Neighborhood`] instance must live as long as the iterator.
/// (Note that the iterator highly depends on the `current_solution` and that the [`Neighborhood`] may
/// have some attributes which goes into the iterator.)
pub trait ParallelNeighborhood<S: Send>: Send + Sync {
    /// Returns an [`ParallelIterator`] over all neighbors of `current_solution`.
    fn neighbors_of<'a>(&'a self, current_solution: &'a S) -> impl ParallelIterator<Item = S> + 'a;
}