pub struct MinConn(pub bool);
Expand description
Specifies that the partitioning routines should try to minimize the maximum degree of the subdomain graph.
I.e., the graph in which each partition is a node, and edges connect subdomains with a shared interface.
Tuple Fields§
§0: bool
Trait Implementations§
source§impl Opt for MinConn
impl Opt for MinConn
source§const INDEX: usize = 11usize
const INDEX: usize = 11usize
Index of the option in the array from
crate::Graph::set_options
and
crate::Mesh::set_options
.source§fn value(self) -> Idx
fn value(self) -> Idx
Convert the value into metis’ format, for use with
crate::Graph::set_options
and crate::Mesh::set_options
.Auto Trait Implementations§
impl Freeze for MinConn
impl RefUnwindSafe for MinConn
impl Send for MinConn
impl Sync for MinConn
impl Unpin for MinConn
impl UnwindSafe for MinConn
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