Enum rustc_data_structures::graph::scc::NodeState

enum NodeState<N, S> {
    NotVisited,
    BeingVisited {
        depth: usize,
    },
    InCycle {
        scc_index: S,
    },
    InCycleWith {
        parent: N,
    },
}

Variants

NotVisited

This node has not yet been visited as part of the DFS.

After SCC construction is complete, this state ought to be impossible.

BeingVisited

Fields

depth: usize

This node is currently being walk as part of our DFS. It is on the stack at the depth depth.

After SCC construction is complete, this state ought to be impossible.

InCycle

Fields

scc_index: S

Indicates that this node is a member of the given cycle.

InCycleWith

Fields

parent: N

Indicates that this node is a member of whatever cycle parent is a member of. This state is transient: whenever we see it, we try to overwrite it with the current state of parent (this is the “path compression” step of a union-find algorithm).

Trait Implementations

impl<N: Clone, S: Clone> Clone for NodeState<N, S>

fn clone(&self) -> NodeState<N, S>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Debug, S: Debug> Debug for NodeState<N, S>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: Copy, S: Copy> Copy for NodeState<N, S>

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.