pub enum RootChoice {
Degree,
Eccentricity,
}Expand description
Heuristic for selecting tree-layout roots when multiple candidates exist within a component.
Variants§
Degree
Pick the vertex with the highest degree (out- or in-degree for directed graphs). Fast — O(n) after sorting.
Eccentricity
Pick the vertex with the lowest eccentricity (“most central”). Produces wide, shallow layouts. Slow — O(n²) eccentricity BFS.
Trait Implementations§
Source§impl Clone for RootChoice
impl Clone for RootChoice
Source§fn clone(&self) -> RootChoice
fn clone(&self) -> RootChoice
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for RootChoice
impl Debug for RootChoice
Source§impl PartialEq for RootChoice
impl PartialEq for RootChoice
impl Copy for RootChoice
impl Eq for RootChoice
impl StructuralPartialEq for RootChoice
Auto Trait Implementations§
impl Freeze for RootChoice
impl RefUnwindSafe for RootChoice
impl Send for RootChoice
impl Sync for RootChoice
impl Unpin for RootChoice
impl UnsafeUnpin for RootChoice
impl UnwindSafe for RootChoice
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