Enum GraphLayoutAlgorithm 

pub enum GraphLayoutAlgorithm {
    ForceDirected,
    Circular,
    Hierarchical,
    Grid,
    Organic,
}

Graph layout algorithms

Variants

ForceDirected

Spring-mass model layout.

Circular

Arrange nodes in a circle.

Hierarchical

Layered arrangement for directed acyclic graphs.

Grid

Arrange nodes in a regular grid.

Organic

Natural-looking organic arrangement.

Trait Implementations

impl Clone for GraphLayoutAlgorithm

fn clone(&self) -> GraphLayoutAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphLayoutAlgorithm

impl Debug for GraphLayoutAlgorithm

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

Formats the value using the given formatter.

impl Eq for GraphLayoutAlgorithm

impl PartialEq for GraphLayoutAlgorithm

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