How does LangGraph's StateGraph enable agent loops that a standard DAG pipeline cannot express?

A **DAG** is a directed acyclic graph. Acyclic means it has no cycles, so every edge points forward and you can never return to a node you already ran. Classic LLM pipelines, like a chain that retrieves then generates then formats, are DAGs. They run each step exactly once in a fixed order. That shape cannot express an agent. An agent does not know up front how many steps it needs. It reasons, calls a tool, looks at the result, and often has to reason again with that new information. That means going back to an earlier step, which a DAG forbids. LangGraph's **StateGraph** removes the acyclic restriction. It is a directed graph that allows cycles, so an edge can point from a later node back to an earlier one. After the tool node runs, an edge can route back to the reasoning node to try again. The piece that decides is a conditional edge. It reads the shared state and picks the next node: loop back if the agent is not done, or go to the end if it is. Because the loop lives in the graph, you can draw it, pause it, save a checkpoint, and replay it, instead of hiding it in a plain while loop.

A **DAG** pipeline allows edges in one direction only. Nodes run in topological order, each exactly once, with no path back to an earlier node. That fits a fixed workflow like retrieve then generate. It cannot express an agent that must revisit its reasoning step after every tool call. LangGraph's StateGraph drops the acyclic constraint. It is a directed graph that permits cycles, so an edge can point from a later node back to an earlier one. The agent loop becomes a first-class topology: a reason node, a tool node, and a loop-back edge between them. The deciding mechanism is the conditional edge. After a node runs, a routing function reads the shared state and returns the name of the next node. It sends control back to the reason node while work remains, or forward to the end node once the model signals completion. The loop is state-driven, not a fixed counter. The condition tests an actual value in state, such as whether a final answer was produced. Because the cycle is an explicit graph object, it is inspectable, checkpointable at each node, and resumable, unlike a while loop buried in application code.