Enum RootChoice 

pub enum RootChoice {
    Degree,
    Eccentricity,
}

Heuristic used by Graph::roots_for_tree_layout to choose among several possible roots (igraph_root_choice_t).

Variants

Degree

Prefer the vertices with the highest degree (out- or in-degree in directed mode). Fast even on large graphs.

Eccentricity

Prefer the vertices with the lowest eccentricity: usually gives “wide and shallow” trees, but takes quadratic time.

Trait Implementations

impl Clone for RootChoice

fn clone(&self) -> RootChoice

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RootChoice

impl Debug for RootChoice

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

Formats the value using the given formatter.

impl Eq for RootChoice

impl From<RootChoice> for igraph_root_choice_t

fn from(value: RootChoice) -> igraph_root_choice_t

Converts to this type from the input type.

impl Hash for RootChoice

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 RootChoice

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

impl TryFrom<u32> for RootChoice

type Error = Error

The type returned in the event of a conversion error.

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

Performs the conversion.