pub trait WithSuccessors: DirectedGraphwhere
    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> Iterator for DepthFirstSearch<'_, G>where
    G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
type Item = G::Node;

   where
        Self: WithNumNodes
, { ... } }

Required Methods

Provided Methods

Implementations on Foreign Types

Implementors

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

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