pub struct GraphLayout { /* private fields */ }Expand description
Computes node positions using the selected layout algorithm.
Implementations§
Source§impl GraphLayout
impl GraphLayout
Sourcepub fn new(algorithm: LayoutAlgorithm) -> Self
pub fn new(algorithm: LayoutAlgorithm) -> Self
Create a new graph layout with the given algorithm.
Sourcepub fn compute(
&self,
node_ids: &[LayoutNodeId],
edges: &[LayoutEdge],
) -> HashMap<LayoutNodeId, Position>
pub fn compute( &self, node_ids: &[LayoutNodeId], edges: &[LayoutEdge], ) -> HashMap<LayoutNodeId, Position>
Compute positions for nodes given the edge list.
Auto Trait Implementations§
impl Freeze for GraphLayout
impl RefUnwindSafe for GraphLayout
impl Send for GraphLayout
impl Sync for GraphLayout
impl Unpin for GraphLayout
impl UnsafeUnpin for GraphLayout
impl UnwindSafe for GraphLayout
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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