Struct IrGraph 

pub struct IrGraph {
    pub name: String,
    pub nodes: Vec<IrNode>,
    pub inputs: Vec<NodeId>,
    pub outputs: Vec<IrOutput>,
    pub params: Vec<IrParam>,
    pub asserts: Vec<IrAssert>,
    pub name_to_id: HashMap<String, NodeId>,
}

Fields

name: String

Graph name (e.g., “Forward”).

nodes: Vec<IrNode>

All nodes, indexed by NodeId.

inputs: Vec<NodeId>

Input nodes (by NodeId).

outputs: Vec<IrOutput>

Named outputs.

params: Vec<IrParam>

Learnable parameters.

asserts: Vec<IrAssert>

Assertions to verify.

name_to_id: HashMap<String, NodeId>

Node lookup by name.

Implementations

impl IrGraph

pub fn new(name: impl Into<String>) -> IrGraph

Create a new empty graph.

pub fn add_node( &mut self, name: impl Into<String>, op: OpKind, inputs: Vec<NodeId>, output_type: IrType, ) -> NodeId

Add a node and return its NodeId.

pub fn add_output(&mut self, node_id: NodeId)

Register a node as an output. Uses the node’s name as the output name.

pub fn add_output_named(&mut self, name: impl Into<String>, node_id: NodeId)

Register a node as an output with a custom name.

pub fn get_node(&self, name: &str) -> Option<&IrNode>

Look up a node by name.

pub fn node(&self, id: NodeId) -> &IrNode

Get a node by its ID.

pub fn node_mut(&mut self, id: NodeId) -> &mut IrNode

Get a mutable reference to a node by its ID.

pub fn len(&self) -> usize

Return the total number of nodes.

pub fn is_empty(&self) -> bool

Check if the graph is empty.

pub fn topo_order(&self) -> Vec<NodeId>

Return a topological ordering of node IDs for execution.

pub fn dump(&self) -> String

Pretty-print the graph for debugging.

Trait Implementations

impl Clone for IrGraph

fn clone(&self) -> IrGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IrGraph

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

Formats the value using the given formatter.