Struct ComputeGraph 

pub struct ComputeGraph {
    pub nodes: Vec<GraphNode>,
    pub outputs: Vec<NodeId>,
}

A directed acyclic compute graph. Acyclic by construction: ComputeGraph::push only accepts inputs that reference already-added nodes (or EXTERNAL), so insertion order is a valid topological order. nodes[i].out.producer == NodeId(i).

Fields

nodes: Vec<GraphNode>

outputs: Vec<NodeId>

Implementations

impl ComputeGraph

pub fn new() -> Self

Empty graph.

pub fn push( &mut self, op: OpNode, ins: &[TensorRef], out_shape: Shape, out_dtype: DType, sched: Schedule, ) -> Result<TensorRef, ForgeError>

Append a node and return a TensorRef to its output. Enforces:

• at most MAX_IN inputs;
• every non-external input references an already-added node (→ acyclic, and insertion order is topological);
• each input edge’s declared shape/dtype matches its producer’s output (shape compatibility) — runtime-parameterized dims (0) are treated as wildcards.

pub fn mark_output(&mut self, t: TensorRef)

Mark a tensor as a graph output.

pub fn len(&self) -> usize

Number of nodes.

pub fn is_empty(&self) -> bool

Whether the graph has no nodes.

Trait Implementations

impl Clone for ComputeGraph

fn clone(&self) -> ComputeGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ComputeGraph

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

Formats the value using the given formatter.

impl Default for ComputeGraph

fn default() -> ComputeGraph

Returns the “default value” for a type.