Explicit graph topology
Define serializable nodes, edges, conditions, and entry points instead of hiding control flow in an agent loop
Build explicit graphs, constrain state access, inspect every run, and recover from checkpoints
WeaveFlow is a graph runtime written in Go for building, executing, and inspecting LLM agent workflows. It combines a declarative Graph Definition with explicit execution, checkpointed state, and reusable nodes for model calls, tool use, planning, routing, and human approval.
The project is designed to run locally first: the runtime and Workbench can run on your own machine, while Graph Definitions remain portable JSON documents.