Google
ADK for Go 2.0 introduces a graph-based workflow engine for composing multi-agent applications whose execution can classify, branch, fan out, gather results, pause for human input, retry, and loop. Graphs consist of typed nodes and routed edges, with constructors for functions, emitting functions, agents, tools, joins, parallel workers, state-bound nodes, dynamic orchestration, and nested workflows; a scheduler handles concurrency, persistence, backpressure, cancellation, and resumption. Its built-in human-in-the-loop primitive validates responses, supports handoff or re-entry, and can resume durably after process restarts, while agent modes and a unified node runtime align single agents with full graphs. The release is highly additive for ADK 1.0 users, though context and event APIs require mechanical migrations, and it provides workflow examples for basic, routing, dynamic, HITL, and complex graphs.