Skip to content

Graph Execution

Graphs execute nodes level by level.

Execution Flow

graph TB
    A[User Input] --> B[Level 0: start]
    B --> C[Level 1: Node A, B]
    C --> D[Level 2: Node C]
    D --> E[Return Result]

Execution Rules: - Nodes at the same level execute sequentially - Each node waits for upstream nodes to complete - Nodes receive upstream outputs as input

Execution Modes

Mode Response Use Case
Stream Each node streams content output Interactive tasks
Background Immediate conversation ID Long-running tasks

Handoffs Execution

Nodes with Handoffs can dynamically choose the next step:

graph LR
    A[Node Executes] --> B{Select Next Node}
    B -->|Select Node X| C[Execute Node X]
    B -->|Limit Reached| D[Continue Next Level]
    C --> B

Each Handoffs node has a selection count limit, automatically continues normal flow when limit is reached.

Final Output

Method Description
Use Template Configure end_template, use {{node_name}} to reference node outputs
Last Node Use output from the last executed node

Next Steps