Function lower_graph
pub fn lower_graph<L>(
graph: &ComputeGraph,
lowerer: &mut L,
) -> Result<(), ForgeError>where
L: Lowerer,Expand description
Walk the graph in topological (insertion) order and dispatch each node to its
Lowerer method. The single, backend-agnostic lowering driver — every backend is a
Lowerer impl, so there are no per-kernel.id branches.