Struct ComputationGraph 

pub struct ComputationGraph {
    pub nodes: HashMap<usize, OpNode>,
    pub adjacency: HashMap<usize, Vec<usize>>,
    pub inputs: Vec<usize>,
    pub outputs: Vec<usize>,
    /* private fields */
}

Computation graph for optimization analysis

Fields

nodes: HashMap<usize, OpNode>

All operation nodes

adjacency: HashMap<usize, Vec<usize>>

Graph topology (adjacency list)

inputs: Vec<usize>

Input nodes (no dependencies)

outputs: Vec<usize>

Output nodes (no dependents)

Implementations

impl ComputationGraph

pub fn new() -> Self

Create a new empty computation graph

pub fn add_node( &mut self, op_type: String, output_shape: Vec<usize>, flops: u64, ) -> usize

Add a node to the graph

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

Add an edge between two nodes

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

Compute topological order of nodes

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

Find fusable operation sequences

pub fn estimate_memory_usage(&self) -> usize

Estimate memory usage for the graph

pub fn estimate_flops(&self) -> u64

Estimate total computation cost

Trait Implementations

impl Debug for ComputationGraph

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

Formats the value using the given formatter.