Executes a compiled graph workflow.
Uses a super-step model: each step finds all runnable nodes, executes them in parallel, merges state, then resolves edges to find the next set of runnable nodes.
Optional
Executes a compiled graph workflow.
Uses a super-step model: each step finds all runnable nodes, executes them in parallel, merges state, then resolves edges to find the next set of runnable nodes.