Enum MstAlgorithm 

pub enum MstAlgorithm {
    Automatic,
    Unweighted,
    Prim,
    Kruskal,
}

Minimum spanning tree algorithm (igraph_mst_algorithm_t).

Variants

Automatic

Let igraph choose.

Unweighted

Unweighted (BFS based).

Prim

Prim’s algorithm.

Kruskal

Kruskal’s algorithm.

Trait Implementations

impl Clone for MstAlgorithm

fn clone(&self) -> MstAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for MstAlgorithm

impl Debug for MstAlgorithm

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

Formats the value using the given formatter.

impl Eq for MstAlgorithm

impl From<MstAlgorithm> for igraph_mst_algorithm_t

fn from(value: MstAlgorithm) -> igraph_mst_algorithm_t

Converts to this type from the input type.

impl Hash for MstAlgorithm

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 MstAlgorithm

fn eq(&self, other: &MstAlgorithm) -> 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 StructuralPartialEq for MstAlgorithm

impl TryFrom<u32> for MstAlgorithm

type Error = Error

The type returned in the event of a conversion error.

fn try_from(value: igraph_mst_algorithm_t) -> Result<Self>

Performs the conversion.