Enum FasAlgorithm 

pub enum FasAlgorithm {
    ExactIp,
    ApproxEades,
    ExactIpCg,
    ExactIpTi,
}

Feedback arc set algorithm (igraph_fas_algorithm_t).

Variants

ExactIp

Minimum feedback arc set by integer programming, letting igraph pick the best such method (currently FasAlgorithm::ExactIpCg).

ApproxEades

Eades–Lin–Smyth heuristic: linear time, at most |E|/2 - |V|/6 edges, not necessarily minimum.

ExactIpCg

Exact integer programming on a set cover formulation, with incremental generation of cycle constraints.

ExactIpTi

Exact integer programming on a topological order formulation with triangle inequalities (typically much slower than FasAlgorithm::ExactIpCg).

Trait Implementations

impl Clone for FasAlgorithm

fn clone(&self) -> FasAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for FasAlgorithm

impl Debug for FasAlgorithm

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

Formats the value using the given formatter.

impl Eq for FasAlgorithm

impl From<FasAlgorithm> for igraph_fas_algorithm_t

fn from(value: FasAlgorithm) -> igraph_fas_algorithm_t

Converts to this type from the input type.

impl Hash for FasAlgorithm

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 FasAlgorithm

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

impl TryFrom<u32> for FasAlgorithm

type Error = Error

The type returned in the event of a conversion error.

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

Performs the conversion.