Struct ExecutableGraph 

pub struct ExecutableGraph<P> { /* private fields */ }

The finalized artifact ready for execution.

Implementations

impl<P: ControlFlowProtocol> ExecutableGraph<P>

pub fn execute( &self, input: P, start_node: usize, max_steps: usize, queue: &mut VecDeque<(usize, P)>, ) -> Result<P, GraphError>

Executes the graph with an initial input using an iterative BFS approach.

Arguments

• input - The initial protocol message to start execution.
• start_node - The index of the starting node.
• max_steps - Safety limit to prevent infinite loops in cyclic graphs.
• queue - A mutable reference to a VecDeque to be used as the execution queue.

The caller is responsible for pre-allocating queue capacity to avoid runtime allocations.

Returns

• Result<P, GraphError> - The final result of the execution or an error.

impl<P: ControlFlowProtocol> ExecutableGraph<P>

pub fn nodes(&self) -> &Vec<ExecutableNode<P>>

pub fn adjacency(&self) -> &Vec<Vec<usize>>