pub struct DirectedCycler { /* private fields */ }
Expand description
有向图环检测
§用法
use algorithms_fourth::digraph::Digraph;
use algorithms_fourth::digraph::cycle::DirectedCycler;
let mut g = Digraph::new(6);
g.add_edge(0, 5);
g.add_edge(3, 5);
g.add_edge(4, 3);
g.add_edge(5, 4);
let dc = DirectedCycler::new(&g);
assert_eq!(dc.has_cycle(),true);
assert_eq!(dc.cycle().collect::<Vec<_>>(),vec![&3,&4,&5,&3]);
Implementations§
Auto Trait Implementations§
impl Freeze for DirectedCycler
impl RefUnwindSafe for DirectedCycler
impl Send for DirectedCycler
impl Sync for DirectedCycler
impl Unpin for DirectedCycler
impl UnwindSafe for DirectedCycler
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