Why ADK 2.0 Moves Routing to a Graph Engine and Keeps Inference in the Model
ADK 2.0 introduces a graph‑based Workflow Runtime that separates routing from LLM inference, replacing Sequential/Parallel/Loop agents with deterministic nodes, cutting token usage by ~50% and latency by ~20%, while adding HITL, automatic retries, and a clear migration path for Python and Go users.
