pub enum Layout {
Circular,
Force,
}Expand description
Node placement strategy.
Variants§
Circular
Force
Deterministic Fruchterman–Reingold (edges pull, all nodes repel). O(n²) per iteration — best for small/medium graphs.
Trait Implementations§
impl Copy for Layout
impl Eq for Layout
Source§impl From<GraphLayout> for Layout
impl From<GraphLayout> for Layout
Source§fn from(l: GraphLayout) -> Self
fn from(l: GraphLayout) -> Self
Converts to this type from the input type.
Source§impl From<Layout> for GraphLayout
impl From<Layout> for GraphLayout
impl StructuralPartialEq for Layout
Auto Trait Implementations§
impl Freeze for Layout
impl RefUnwindSafe for Layout
impl Send for Layout
impl Sync for Layout
impl Unpin for Layout
impl UnsafeUnpin for Layout
impl UnwindSafe for Layout
Blanket Implementations§
impl<T> Allocation for T
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