Enum GraphPartitioner 

#[repr(u8)]
pub enum GraphPartitioner {
    None,
    Manual(Vec<usize>),
    Coupe,
    Scotch,
}

Graph partitioner

Variants

None

No partioner: cells are split into approximately equal sized lists by index

Manual(Vec<usize>)

A manual partition

Coupe

Use Coupe’s KMeans implementation to generate a partition

Scotch

Use Scotch to generate a partition

Trait Implementations

impl Clone for GraphPartitioner

fn clone(&self) -> GraphPartitioner

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphPartitioner

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphPartitioner

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for GraphPartitioner

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for GraphPartitioner

fn eq(&self, other: &GraphPartitioner) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GraphPartitioner

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for GraphPartitioner

impl StructuralPartialEq for GraphPartitioner