Struct DecomposedGraph 

pub struct DecomposedGraph {
    pub input_count: usize,
    pub nodes: Vec<(Box<dyn PolydatNode>, Vec<DecomposedWire>)>,
    pub output_wires: Vec<DecomposedWire>,
}

A mini-DAG used for equivalence testing.

Built by fused nodes to represent their unfused (decomposed) form. Not used at runtime — only in tests.

Fields

input_count: usize

External inputs the graph takes.

nodes: Vec<(Box<dyn PolydatNode>, Vec<DecomposedWire>)>

Each node with the wiring of its inputs, in order.

output_wires: Vec<DecomposedWire>

Where each output comes from.

Implementations

impl DecomposedGraph

pub fn new(input_count: usize) -> Self

An empty graph over input_count inputs.

pub fn add_node( &mut self, node: Box<dyn PolydatNode>, wires: Vec<DecomposedWire>, ) -> usize

Add a node and return its index.

pub fn set_outputs(&mut self, wires: Vec<DecomposedWire>)

Set the output wire(s) of this graph.

pub fn eval(&self, inputs: &[Value]) -> Vec<Value>

Evaluate this decomposed graph on the given inputs. Returns the output values.