pub enum FasAlgorithm {
EadesLinSmyth,
}Expand description
Algorithm choice for computing the feedback arc set.
Variants§
EadesLinSmyth
For undirected graphs: non-tree edges of a maximum-weight spanning tree. For directed graphs: Eades-Lin-Smyth heuristic.
Trait Implementations§
Source§impl Clone for FasAlgorithm
impl Clone for FasAlgorithm
Source§fn clone(&self) -> FasAlgorithm
fn clone(&self) -> FasAlgorithm
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 FasAlgorithm
impl Debug for FasAlgorithm
Source§impl PartialEq for FasAlgorithm
impl PartialEq for FasAlgorithm
impl Copy for FasAlgorithm
impl Eq for FasAlgorithm
impl StructuralPartialEq for FasAlgorithm
Auto Trait Implementations§
impl Freeze for FasAlgorithm
impl RefUnwindSafe for FasAlgorithm
impl Send for FasAlgorithm
impl Sync for FasAlgorithm
impl Unpin for FasAlgorithm
impl UnsafeUnpin for FasAlgorithm
impl UnwindSafe for FasAlgorithm
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