Struct ComputeGraph 

pub struct ComputeGraph { /* private fields */ }

Directed acyclic graph of compute nodes with resource binding management.

Implementations

impl ComputeGraph

pub fn new() -> Self

Create an empty compute graph.

pub fn add_node(&mut self, node: GraphNode) -> Result<(), GraphError>

Add a node to the graph.

Errors

Returns GraphError::DuplicateNode if a node with the same ID already exists.

pub fn bind_resource( &mut self, node_id: u32, binding: ResourceBinding, ) -> Result<(), GraphError>

Attach a resource binding to an existing node.

Errors

Returns GraphError::NodeNotFound if the node does not exist. Returns GraphError::IncompatibleBinding if the resource type is not appropriate for the node kind (e.g. binding a buffer to a Barrier).

pub fn add_edge(&mut self, from: u32, to: u32) -> Result<(), GraphError>

Add a directed edge: from → to (node from must execute before to).

Errors

• GraphError::NodeNotFound if either node is missing.
• GraphError::CyclicEdge if the edge would introduce a cycle.

pub fn execution_order(&self) -> Result<ExecutionPlan, GraphError>

Compute a valid ExecutionPlan via topological ordering (Kahn’s algorithm with deterministic tie-breaking by node ID).

Errors

Returns GraphError::CycleDetected if the graph contains a cycle (defensive; the add_edge invariant should prevent this).

pub fn validate(&self) -> Result<(), GraphError>

Validate that every Kernel and Copy node has at least one resource binding and that no required named bindings are missing.

Barrier nodes are not checked (they do not use resource bindings).

Errors

Returns the first GraphError::MissingBinding encountered.

pub fn node_count(&self) -> usize

Number of nodes in the graph.

pub fn edge_count(&self) -> usize

Number of directed edges in the graph.

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

Retrieve a node by ID.

pub fn predecessors(&self, node_id: u32) -> Result<Vec<u32>, GraphError>

Return the IDs of all direct predecessors (nodes that must run before node_id).

Errors

Returns GraphError::NodeNotFound if the ID is not registered.

pub fn successors(&self, node_id: u32) -> Result<Vec<u32>, GraphError>

Return the IDs of all direct successors (nodes that must run after node_id).

Errors

Returns GraphError::NodeNotFound if the ID is not registered.

Trait Implementations

impl Default for ComputeGraph

fn default() -> Self

Returns the “default value” for a type.