Struct ComponentGraph 

pub struct ComponentGraph {
    pub components: Vec<ComponentDecl>,
    pub wirings: Vec<QueueWiring>,
}

Component graph representing the DAG of WASM components.

Components are topologically sorted for initialization order. Queue wiring defines inter-component communication.

Fields

components: Vec<ComponentDecl>

Component declarations (topologically sorted).

wirings: Vec<QueueWiring>

Queue wiring (connections between components).

Implementations

impl ComponentGraph

pub fn new() -> Self

Creates an empty component graph.

pub fn component_count(&self) -> usize

Returns the number of components.

pub fn wiring_count(&self) -> usize

Returns the number of queue wirings.

pub fn validate(&self) -> bool

Validates the component graph structure.

Returns true if:

• Components form a valid DAG (no cycles)
• All wiring references valid components
• Root component exists (index 0) or graph is empty (Phase A allows empty)

Trait Implementations

impl Clone for ComponentGraph

fn clone(&self) -> ComponentGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ComponentGraph

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

Formats the value using the given formatter.

impl Default for ComponentGraph

fn default() -> ComponentGraph

Returns the “default value” for a type.