firehose> #llmops

Agent Task Graph

The coordination substrate for a team of agents: a shared, mutable task list where each task carries an owner and explicit dependency edges, so a primary (orchestrator) agent can delegate work to specialized sub-agents and let their outputs unblock each other without a human hand-carrying state between them. It is the Agentic Workflow Patterns orchestrator-workers topology given a native, first-class data structure instead of an ad-hoc prompt: the plan is a graph, not a linear checklist.

Claude Code's Task System is the concrete instance. Its TaskUpdate tool exposes the graph directly: taskId, status (pending | in_progress | completed | deleted), owner (which agent holds the task), metadata, and the two edge-builders addBlocks: string[] and addBlockedBy: string[]. As sub-agents finish work they ping back to the primary agent; completing a task clears the blockedBy edges of its dependents, so blocked tasks become runnable in dependency order. The system is on by default when sub-agents are in play, and it "really helps in the planning phase" — you can lay out specialized agents and their Parallel: true/false structure up front and let the graph sequence execution.

The recurring team shape is the builder/validator pair: for every build task, a paired validation task that Depends On it, is Assigned To a validator agent, and gates on an executable check (a py_compile, a "contains required section" test). Coordination without dependency edges and without a channel for agents to communicate degrades into agents working past each other — the graph is what makes "more agents" cohere toward a common goal rather than just adding autonomy (see Agentic Simplicity).

Claims


Linked from