Struct Flow 

pub struct Flow {
    pub level: Vec<Option<u32>>,
    pub edges: BTreeSet<(Node, ExpId)>,
    pub routes: Vec<Option<Route>>,
    pub states: usize,
    pub truncated: bool,
}

Fields

level: Vec<Option<u32>>

Per expectation: the fewest steps from a start before it applies, if it ever does.

edges: BTreeSet<(Node, ExpId)>

(parent, child) edges of the DAG.

routes: Vec<Option<Route>>

Per expectation: a shortest route to it.

states: usize

truncated: bool

The search hit its limits, so “unreachable” isn’t conclusive.

Implementations

impl Flow

pub fn parents(&self, e: ExpId) -> impl Iterator<Item = Node> + '_

pub fn children(&self, n: Node) -> impl Iterator<Item = ExpId> + '_

Trait Implementations

impl Debug for Flow

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

Formats the value using the given formatter.

impl Default for Flow

fn default() -> Flow

Returns the “default value” for a type.