Enum LayoutAlgorithm

Source

pub enum LayoutAlgorithm {
    ForceDirected {
        iterations: usize,
        spring_length: Option<f64>,
        cooling: f64,
    },
    Hierarchical {
        layer_spacing: f64,
        node_spacing: f64,
    },
    Circular {
        radius: f64,
    },
    Spectral {
        iterations: usize,
    },
}

Expand description

Available graph layout algorithms

Variants§

§

ForceDirected

Fruchterman-Reingold force-directed layout

Fields

§iterations: usize

Number of iterations to run

§spring_length: Option<f64>

Ideal spring length (None → auto-compute from area)

§cooling: f64

Cooling coefficient: temperature decreases each iteration

§

Hierarchical

Layer-based hierarchical layout

Fields

§layer_spacing: f64

Vertical spacing between layers

§node_spacing: f64

Horizontal spacing between nodes in the same layer

§

Circular

Circular layout: nodes arranged around a circle

Fields

§radius: f64

Radius of the circle

§

Spectral

Spectral layout using graph Laplacian eigenvectors

Fields

§iterations: usize

Number of eigenvector iterations (power method)

Trait Implementations§

Source §

impl Clone for LayoutAlgorithm

Source §

fn clone(&self) -> LayoutAlgorithm

Returns a duplicate of the value. Read more

1.0.0 · Source§

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

Performs copy-assignment from source. Read more

Source §

impl Debug for LayoutAlgorithm

Source §

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

Formats the value using the given formatter. Read more

Source §

impl Default for LayoutAlgorithm

Source §

fn default() -> Self

Returns the “default value” for a type. Read more

Source §

impl PartialEq for LayoutAlgorithm

Source §

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

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

1.0.0 · Source§

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

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

Source §

impl StructuralPartialEq for LayoutAlgorithm

Auto Trait Implementations§

§

impl UnwindSafe for LayoutAlgorithm

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> CloneToUninit for T
where T: Clone,

Source §

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)

Performs copy-assignment from self to dest. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §