Struct DirectedCycler

pub struct DirectedCycler { /* private fields */ }

有向图环检测

用法

 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

impl DirectedCycler

pub fn new(g: &Digraph) -> Self

pub fn has_cycle(&self) -> bool

pub fn cycle(&self) -> Iter<'_, usize>