Trait rustc_data_structures::graph::WithSuccessors

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

    fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self> 
    where
        Self: WithNumNodes,
    { ... }
}

Required Methods

fn successors(&self, node: Self::Node) -> <Self as GraphSuccessors<'_>>::Iter

Provided Methods

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self> where
    Self: WithNumNodes,

Implementations on Foreign Types

impl<'graph, G: WithSuccessors> WithSuccessors for &'graph G

fn successors(&self, node: Self::Node) -> <Self as GraphSuccessors<'_>>::Iter

Implementors

impl<N: Idx + Ord> WithSuccessors for VecGraph<N>

impl<N: Idx, S: Idx + Ord> WithSuccessors for Sccs<N, S>

impl<'s, 'tcx, D: ConstraintGraphDirecton> WithSuccessors for RegionGraph<'s, 'tcx, D>

impl<'tcx> WithSuccessors for BasicBlocks<'tcx>

impl WithSuccessors for CoverageGraph