A state graph is a network of nodes (steps) and edges (transitions) that defines the possible paths and handoffs a long-running system can take.
Loops decide what to do next; graphs decide what comes next. The interesting long-running systems are graphs of loops — the graph for routing and auditability, the loops for the parts where the model should genuinely be choosing.
For the full comparison, see Loops vs Graphs.