Struct chalk_recursive::fixed_point::search_graph::Node

pub(super) struct Node<K, V> {
    pub(crate) goal: K,
    pub(crate) solution: V,
    pub(crate) stack_depth: Option<StackDepth>,
    pub(crate) links: Minimums,
}

Fields

goal: K

solution: V

stack_depth: Option<StackDepth>

This is Some(X) if we are actively exploring this node, or None otherwise.

links: Minimums

While this node is on the stack, this field will be set to contain our own depth-first number. Once the node is popped from the stack, it contains the DFN of the minimal ancestor that the table reached (or MAX if no cycle was encountered).