Struct forceatlas2::Layout

pub struct Layout<T: Coord> {
    pub edges: Vec<Edge>,
    pub masses: Vec<T>,
    pub points: PointList<T>,
    pub speeds: PointList<T>,
    pub old_speeds: PointList<T>,
    // some fields omitted
}

Fields

edges: Vec<Edge>

masses: Vec<T>

points: PointList<T>

List of the nodes’ positions

speeds: PointList<T>

old_speeds: PointList<T>

Implementations

impl<T: Coord> Layout<T>

pub fn iter_nodes(&mut self) -> NodeIter<'_, T>

impl<T: Coord + Send> Layout<T>

pub fn iter_par_nodes(
    &mut self,
    chunk_size: usize
) -> impl Iterator<Item = impl ParallelIterator<Item = NodeParIter<'_, T>>>

impl<T: Coord + Send> Layout<T>

pub fn iter_par_simd_nodes<const N: usize>(
    &mut self,
    chunk_size: usize
) -> impl Iterator<Item = impl ParallelIterator<Item = NodeParSimdIter<'_, T, N>>>

impl<'a, T: Coord + Debug> Layout<T> where
    Layout<T>: Repulsion<T> + Attraction<T>, 

pub fn from_graph(
    edges: Vec<Edge>,
    nodes: Nodes<T>,
    settings: Settings<T>
) -> Self where
    Standard: Distribution<T>,
    T: SampleUniform, 

Instanciates a randomly positioned layout from an undirected graph

Assumes edges (n1, n2) respect n1 < n2.

pub fn from_position_graph(
    edges: Vec<Edge>,
    nodes: Nodes<T>,
    positions: Vec<T>,
    settings: Settings<T>
) -> Self where
    T: 'a, 

Instanciates layout from an undirected graph, using initial positions

Assumes edges (n1, n2) respect n1 < n2

nodes is a list of coordinates, e.g. [x1, y1, x2, y2, ...].

pub fn get_settings(&self) -> &Settings<T>

pub fn set_settings(&mut self, settings: Settings<T>)

pub fn iteration(&mut self)

Computes an iteration of ForceAtlas2