#[repr(u8)]pub enum Method {
Morton = 0,
Hilbert = 1,
Rcb = 2,
HilbertFm = 3,
RcbFm = 4,
Scotch = 5,
Multi = 6,
PtScotch = 7,
}Expand description
How partition_graph cuts the cell graph.
Variants§
Morton = 0
Morton order, then a weighted prefix split.
Hilbert = 1
Hilbert order, then a weighted prefix split.
Rcb = 2
Weighted recursive coordinate bisection.
HilbertFm = 3
Hilbert prefix split, then Fiduccia-Mattheyses.
RcbFm = 4
Recursive coordinate bisection, then Fiduccia-Mattheyses.
Scotch = 5
Serial Scotch SCOTCH_graphPart, feature scotch only.
Multi = 6
Heavy-edge coarsening, coarse bisection, refinement on the way back.
PtScotch = 7
PT-Scotch SCOTCH_dgraphPart, feature ptscotch only.
Implementations§
Trait Implementations§
impl Copy for Method
impl Eq for Method
impl StructuralPartialEq for Method
Auto Trait Implementations§
impl Freeze for Method
impl RefUnwindSafe for Method
impl Send for Method
impl Sync for Method
impl Unpin for Method
impl UnsafeUnpin for Method
impl UnwindSafe for Method
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more