Struct OnnxLikeGraph 

pub struct OnnxLikeGraph {
    pub nodes: Vec<OnnxNode>,
    pub initializers: StateDict,
    pub inputs: Vec<String>,
    pub outputs: Vec<String>,
    pub name: String,
}

A simplified ONNX-like computation graph.

Fields

nodes: Vec<OnnxNode>

Ordered list of operation nodes.

initializers: StateDict

Named initialiser tensors (model weights).

inputs: Vec<String>

Input tensor names.

outputs: Vec<String>

Output tensor names.

name: String

Graph name.

Implementations

impl OnnxLikeGraph

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

Create an empty graph.

pub fn add_node(&mut self, node: OnnxNode)

Add an operation node.

pub fn add_initializer(&mut self, name: impl Into<String>, tensor: Tensor)

Add an initialiser.

pub fn node_count(&self) -> usize

Number of nodes in the graph.

pub fn count_op(&self, op: &str) -> usize

Count nodes by op type.

pub fn is_topologically_valid(&self) -> bool

Topological order check: returns true if all node input names are either graph inputs or outputs of an earlier node.

Trait Implementations

impl Clone for OnnxLikeGraph

fn clone(&self) -> OnnxLikeGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OnnxLikeGraph

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

Formats the value using the given formatter.

impl Default for OnnxLikeGraph

fn default() -> OnnxLikeGraph

Returns the “default value” for a type.