Struct ComputationGraph 

pub struct ComputationGraph { /* private fields */ }

Differentiable computation graph

Implementations

impl ComputationGraph

pub fn new(name: String) -> Self

Create a new computation graph

pub fn add_node(&mut self, node: ComputationNode) -> SklResult<()>

Add a node to the graph

pub fn add_input(&mut self, node_id: String, shape: Vec<usize>)

Add an input node

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

Add an output node

pub fn forward( &mut self, inputs: &HashMap<String, Array2<Float>>, ) -> SklResult<HashMap<String, Array2<Float>>>

Forward pass through the graph

pub fn backward( &mut self, output_gradients: &HashMap<String, Array2<Float>>, ) -> SklResult<()>

Backward pass through the graph