Struct Greedy 

pub struct Greedy {
    pub part_count: usize,
}

Greedy number partitioning algorithm

Greedily assign weights to each part.

Example

use coupe::Partition as _;
use coupe::Real;

let weights = [3.2, 6.8, 10.0, 7.5].map(Real::from);
let mut partition = [0; 4];

coupe::Greedy { part_count: 2 }
    .partition(&mut partition, weights)
    .unwrap();

Reference

Horowitz, Ellis and Sahni, Sartaj, 1974. Computing partitions with applications to the knapsack problem. J. ACM, 21(2):277–292. doi:10.1145/321812.321823.

Fields

part_count: usize

Trait Implementations

impl<W> Partition<W> for Greedy

where W: IntoIterator, W::Item: GreedyWeight,

type Metadata = ()

Diagnostic data returned for a specific run of the algorithm.

type Error = Error

Error details, should the algorithm fail to run.

fn partition( &mut self, part_ids: &mut [usize], weights: W, ) -> Result<Self::Metadata, Self::Error>

Partition the given data and output the part ID of each element in part_ids.