Skip to content

Orchestration engine: graph/state runtime core #277

Closed
Closed
Orchestration engine: graph/state runtime core#277
Assignees
Ashishds
Labels
area: orchestrationorchestration engine / graph runtimedifficulty: advancedDeep / large scopehelp wantedGood for contributorspillar: dynaflowdynaflow — orchestration engine & visual builder
Milestone
P1 — Orchestration engine

Description

@codeforstartups
codeforstartups
opened on Oct 1, 2026

Context

The LangGraph-equivalent core: a directed graph of nodes and edges over a shared, typed run state. Executes a graph to completion, threading state between nodes. Foundation for everything in P1–P3.

Scope

  • Define the graph/state data model (nodes, edges, typed shared state)
  • Topological / scheduler-driven execution over the graph
  • State reducers / channels so nodes read and update shared state safely
  • Deterministic execution given the same inputs + state

Acceptance criteria

  • A graph of ≥3 nodes executes end-to-end with state passed between them
  • State updates are isolated per-node and merged via defined reducers
  • Unit tests cover linear, fan-out and fan-in graphs

References

Roadmap doc, §5 (Orchestration engine).

Part of #273 (flow).

Imported from the dynavec — Agent Orchestration Roadmap.

Activity

  1. codeforstartups
    added this to the P1 — Orchestration engine milestone on Oct 1, 2026
  2. codeforstartups
    added
    help wantedGood for contributors
    difficulty: advancedDeep / large scope
    pillar: dynaflowdynaflow — orchestration engine & visual builder
    area: orchestrationorchestration engine / graph runtime
    on Oct 1, 2026

  3. Ashishds commented on Oct 7, 2026

    @Ashishds
    Ashishds
    on Oct 7, 2026
    Contributor

    Hi @codeforstartups,

    I would like to work on this! I have an implementation ready that covers the complete control-flow specification:

    • Conditional / router edges with safe AST expression evaluation and callable predicates
    • Parallel branch fan-out and join (barrier synchronization) with isolated state copies and reducer merging
    • Bounded loops / cycles with termination guards and configurable iteration limits
    • Cycle detection that distinguishes between valid guarded loops and malformed infinite cycles

    Since #278 builds directly on the graph/state runtime core (#277), I've implemented both in a clean dynavec.agents module with zero regressions to the existing ReActAgent/Planner primitives, accompanied by a comprehensive offline test suite.

    Could you please assign this to me? Let me know if you would like this submitted as a combined dynaflow engine PR (#277 + #278) or split into two sequential PRs.

  4. Kaap10
    assigned
    Ashishds
    on Oct 7, 2026
  5. Ashishds
    added a commit that references this issue on Oct 9, 2026

    feat(agents): add dynaflow graph orchestration engine and control flow (

    040ef15
  6. Kaap10
    added a commit that references this issue on Oct 13, 2026

    feat(agents): add dynaflow graph orchestration engine and control flow (

    5f077d3

  7. Kaap10 commented on Oct 13, 2026

    @Kaap10
    Kaap10
    on Oct 13, 2026
    Collaborator

    Resolved by #344.

  8. Kaap10
    closed this as completedon Oct 13, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

Labels

area: orchestrationorchestration engine / graph runtimedifficulty: advancedDeep / large scopehelp wantedGood for contributorspillar: dynaflowdynaflow — orchestration engine & visual builder

Projects

No projects

    Milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions