Trait LayoutAlgorithm 

pub trait LayoutAlgorithm<N, E> {
    // Required methods
    fn name(&self) -> &str;
    fn apply(&mut self, graph: &mut Graph<N, E>) -> Result<()>;

    // Provided methods
    fn is_running(&self) -> bool { ... }
    fn stop(&mut self) -> Result<()> { ... }
    fn progress(&self) -> f64 { ... }
    fn can_interrupt(&self) -> bool { ... }
}

Trait for layout algorithms

Required Methods

fn name(&self) -> &str

Name of the layout algorithm

fn apply(&mut self, graph: &mut Graph<N, E>) -> Result<()>

Apply the layout to the graph

Provided Methods

fn is_running(&self) -> bool

Check if the algorithm is running

fn stop(&mut self) -> Result<()>

Stop the algorithm if it’s running

fn progress(&self) -> f64

Get the progress (0.0 to 1.0)

fn can_interrupt(&self) -> bool

Check if the algorithm can be interrupted

Implementors

impl<N, E> LayoutAlgorithm<N, E> for CircularLayout

impl<N, E> LayoutAlgorithm<N, E> for ForceDirectedLayout

impl<N, E> LayoutAlgorithm<N, E> for GridLayout

impl<N, E> LayoutAlgorithm<N, E> for HierarchicalLayout