pub struct VnBest;
Expand description
Steepest descent Vector-of-Numbers algorithm
This algorithm greedily moves weights from parts to parts in such a way that the balance gain is maximized on each move. See also its non-greedy version.
Example
use coupe::Partition as _;
use rand;
let part_count = 2;
let mut partition = [0; 4];
let weights = [4, 6, 2, 9];
coupe::Random { rng: rand::thread_rng(), part_count }
.partition(&mut partition, ())?;
coupe::VnBest
.partition(&mut partition, weights)?;
Reference
Remi Barat. Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning. Other [cs.OH]. Université de Bordeaux, 2017. English. NNT : 2017BORD0961. tel-01713977
Trait Implementations§
source§impl<W> Partition<W> for VnBestwhere
W: IntoIterator,
W::Item: VnBestWeight,
impl<W> Partition<W> for VnBestwhere W: IntoIterator, W::Item: VnBestWeight,
impl Copy for VnBest
Auto Trait Implementations§
impl RefUnwindSafe for VnBest
impl Send for VnBest
impl Sync for VnBest
impl Unpin for VnBest
impl UnwindSafe for VnBest
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.