Struct Graph 

pub struct Graph {
    pub nodes: Vec<GraphNode>,
    pub names: BTreeMap<usize, String>,
}

The traced computational graph: a list of GraphNodes plus optional node names.

Fields

nodes: Vec<GraphNode>

The graph’s nodes, in the order they were recorded.

names: BTreeMap<usize, String>

Node index → dotted name captured from [crate::name_scope] at recording time.

Implementations

impl Graph

pub fn new() -> Self

Creates an empty graph.

pub fn add_node( &mut self, op: Op, inputs: Vec<usize>, dtype: DtypeRepr, shape: Shape, ) -> usize

Appends a new node to the graph, returning its index.

pub fn topological_sort(&self) -> Vec<usize>

Returns node indices in topological order (producers before consumers) using Kahn’s algorithm. Panics if the graph contains a cycle.

pub fn optimise(&self) -> Graph

Rewrite the graph by fusing compatible op sequences into single fused ops.

Currently recognises: Conv2d(no bias) → BatchNorm2d → Silu and replaces the triple with a single Conv2dBnSilu node.

Nodes that are absorbed into a fused node are removed from the output graph; remaining node indices are renumbered contiguously.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.