Struct rustc_ap_rustc_data_structures::graph::iterate::CycleDetector

pub struct CycleDetector;

This TriColorVisitor looks for back edges in a graph, which indicate that a cycle exists.

Trait Implementations

impl<G: ?Sized> TriColorVisitor<G> for CycleDetector where
    G: DirectedGraph, 

type BreakVal = ()

The value returned by this search.

fn node_examined(
    &mut self,
    _node: G::Node,
    prior_status: Option<NodeStatus>
) -> ControlFlow<Self::BreakVal>

Called when a node is examined by the depth-first search.

fn node_settled(&mut self, _node: G::Node) -> ControlFlow<Self::BreakVal>

Called after all nodes reachable from this one have been examined.

fn ignore_edge(&mut self, _source: G::Node, _target: G::Node) -> bool

Behave as if no edges exist from source to target.