Struct DirectedCycler

Source
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§

Source§

impl DirectedCycler

Source

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

Source

pub fn has_cycle(&self) -> bool

Source

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

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.