Enum MstAlgorithm 

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

Selector for the minimum-spanning-tree algorithm.

Counterpart of the C igraph_mst_algorithm_t enum at spanning_trees.c:461-484.

Variants

Automatic

Let the implementation pick: Unweighted when weights is None, otherwise Kruskal.

Unweighted

Ignore edge weights and run a BFS spanning forest.

Prim

Prim’s algorithm with a binary min-heap (eager variant).

Kruskal

Kruskal’s algorithm with sort + union-find.

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 Debug for MstAlgorithm

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

Formats the value using the given formatter.

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 Copy for MstAlgorithm

impl Eq for MstAlgorithm

impl StructuralPartialEq for MstAlgorithm