Struct WorkflowGraph 

pub struct WorkflowGraph {
    pub entry_module: String,
    pub nodes: Vec<GraphNode>,
    pub edges: Vec<GraphEdge>,
}

A workflow’s primitive structure as an ordered node/edge graph.

A projection of the typed source: extracted, never authored. The node and edge vectors are in deterministic call order so two extractions of the same package are byte-identical.

Fields

entry_module: String

The logical entry-module name the graph was extracted from.

nodes: Vec<GraphNode>

Nodes in deterministic workflow call order.

edges: Vec<GraphEdge>

Directed edges in deterministic order.

Implementations

impl WorkflowGraph

pub fn entry_module(&self) -> &str

The logical entry-module name the graph was extracted from.

pub fn nodes(&self) -> &[GraphNode]

The graph’s nodes in deterministic call order.

pub fn edges(&self) -> &[GraphEdge]

The graph’s edges in deterministic order.

pub fn node(&self, id: NodeId) -> Option<&GraphNode>

Looks up a node by id.

pub fn structurally_equals(&self, other: &Self) -> bool

Whether this graph and other describe the same structure as unordered node and edge sets.

This is the diff primitive the C23 test uses: it proves the extracted node/edge set matches a workflow’s known structure regardless of the internal vector order, so a consumer can assert structural equality without depending on emission order.

Trait Implementations

impl Clone for WorkflowGraph

fn clone(&self) -> WorkflowGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WorkflowGraph

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

Formats the value using the given formatter.

impl Eq for WorkflowGraph

impl PartialEq for WorkflowGraph

fn eq(&self, other: &WorkflowGraph) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for WorkflowGraph