toComputeGraph

fun GraphProgram.toComputeGraph(into: ComputeGraph = DefaultComputeGraph()): ComputeGraph(source)

Lower a symbolic GraphProgram (produced by the DAG DSL) into a concrete ComputeGraph.

Node and edge identifiers follow the same deterministic pattern as trace-based wiring:

  • node ids are preserved from the DSL (defaults are n_),

  • edge ids are derived from endpoints and port indices.