Enum LayoutAlgorithm 

pub enum LayoutAlgorithm {
    Layered,
    Radial,
    Force,
    Stress,
}

Placement algorithm for scheme layout.

Hosts map these onto ELK (or another engine):

• Self::Layered — Sugiyama / layered (default; best for reactions)
• Self::Radial — hub-and-spoke / concentric rings (star-like nets)
• Self::Force — force-directed (undirected / cyclic networks)
• Self::Stress — stress majorization (compact network alternative)

Variants

Layered

Radial

Force

Stress

Trait Implementations

impl Clone for LayoutAlgorithm

fn clone(&self) -> LayoutAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for LayoutAlgorithm

impl Debug for LayoutAlgorithm

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

Formats the value using the given formatter.

impl Default for LayoutAlgorithm

fn default() -> LayoutAlgorithm

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for LayoutAlgorithm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for LayoutAlgorithm

impl PartialEq for LayoutAlgorithm

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for LayoutAlgorithm