Skip to main content

Graph DSL

The graph DSL defines structured execution flows as directed acyclic graphs (DAGs). Nodes represent agent tasks, routing decisions, or data transformations; edges represent data dependencies and control flow. Graphs compile to Temporal workflows with parallel branches and join semantics.

Source: internal/graph/*

Purpose​

Provides a structured execution graph with branching, routing, and joins that compile to Temporal workflows.

Graph Flow​

Map-Reduce Pattern​

Join Semantics​

Key Components​

  • DSL builder: internal/graph/dsl.go
  • Workflow engine: internal/graph/workflow.go
  • Conditions: internal/graph/conditions.go
  • LLM activity: internal/graph/llm_activity.go

CLI​

  • cmd/graph-worker starts the graph worker.
  • cmd/graph-run executes a sample graph.
  • cmd/graph-run-llm executes an LLM-driven graph.
  • cmd/graph-query queries graph state.
  • cmd/graph-approve approves graph steps.