Trait rustc_data_structures::graph::WithSuccessors[−][src]

pub trait WithSuccessors: DirectedGraph where
    Self: for<'graph> GraphSuccessors<'graph, Item = Self::Node>, {
    fn successors(&self, node: Self::Node) -> Self::Iter;

    fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self>ⓘNotable traits for DepthFirstSearch<'_, G>
impl<G: ?Sized> Iterator for DepthFirstSearch<'_, G> where
    G: DirectedGraph + WithNumNodes + WithSuccessors,     type Item = G::Node;
    where
        Self: WithNumNodes,
    { ... }
}

Required methods

`fn successors(&self, node: Self::Node) -> Self::Iter`[src]

Loading content...

Provided methods

`fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self>ⓘNotable traits for DepthFirstSearch<'_, G> impl<G: ?Sized> Iterator for DepthFirstSearch<'_, G> where G: DirectedGraph + WithNumNodes + WithSuccessors, type Item = G::Node; where Self: WithNumNodes,` [src]

Loading content...

Implementations on Foreign Types

`impl<'graph, G: WithSuccessors> WithSuccessors for &'graph G`[src]

`fn successors( &self, node: Self::Node ) -> <&'graph G as GraphSuccessors<'_>>::IterⓘNotable traits for &'_ mut I impl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;`[src]

Loading content...

Implementors

`impl<N: Idx> WithSuccessors for VecGraph<N>`[src]

`fn successors(&self, node: N) -> <VecGraph<N> as GraphSuccessors<'_>>::Iter`[src]

`impl<N: Idx, S: Idx> WithSuccessors for Sccs<N, S>`[src]

`fn successors(&self, node: S) -> <Sccs<N, S> as GraphSuccessors<'_>>::Iter`[src]

Loading content...

Trait rustc_data_structures::graph::WithSuccessors[−][src]

Notable traits for DepthFirstSearch<'_, G>

Required methods

fn successors(&self, node: Self::Node) -> Self::Iter[src]

Provided methods

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self>ⓘNotable traits for DepthFirstSearch<'_, G>impl<G: ?Sized> Iterator for DepthFirstSearch<'_, G> where G: DirectedGraph + WithNumNodes + WithSuccessors, type Item = G::Node; where Self: WithNumNodes, [src]

Notable traits for DepthFirstSearch<'_, G>

Implementations on Foreign Types

impl<'graph, G: WithSuccessors> WithSuccessors for &'graph G[src]

fn successors( &self, node: Self::Node) -> <&'graph G as GraphSuccessors<'_>>::IterⓘNotable traits for &'_ mut Iimpl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;[src]

Notable traits for &'_ mut I

Implementors

impl<N: Idx> WithSuccessors for VecGraph<N>[src]

fn successors(&self, node: N) -> <VecGraph<N> as GraphSuccessors<'_>>::Iter[src]

impl<N: Idx, S: Idx> WithSuccessors for Sccs<N, S>[src]

fn successors(&self, node: S) -> <Sccs<N, S> as GraphSuccessors<'_>>::Iter[src]

`fn successors(&self, node: Self::Node) -> Self::Iter`[src]

`fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self>ⓘNotable traits for DepthFirstSearch<'_, G> impl<G: ?Sized> Iterator for DepthFirstSearch<'_, G> where G: DirectedGraph + WithNumNodes + WithSuccessors, type Item = G::Node; where Self: WithNumNodes,` [src]

`impl<'graph, G: WithSuccessors> WithSuccessors for &'graph G`[src]

`fn successors( &self, node: Self::Node ) -> <&'graph G as GraphSuccessors<'_>>::IterⓘNotable traits for &'_ mut I impl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;`[src]

`impl<N: Idx> WithSuccessors for VecGraph<N>`[src]

`fn successors(&self, node: N) -> <VecGraph<N> as GraphSuccessors<'_>>::Iter`[src]

`impl<N: Idx, S: Idx> WithSuccessors for Sccs<N, S>`[src]

`fn successors(&self, node: S) -> <Sccs<N, S> as GraphSuccessors<'_>>::Iter`[src]