StateGraph
A class in LangGraph for defining state graphs. Workflows are explicitly defined through nodes and edges, and execution order is controlled by code.
Core Facts
Timeline (last 90 days)
In LangGraph's StateGraph, the parent graph and subgraph each maintain their own state schema, and only keys declared on both sides are passed across the boundary; keys produced by the parent step but not declared in the sub-schema silently disappear on the subgraph side, without throwing an exception or producing a warning log.
The workflow is orchestrated with LangGraph's StateGraph, the state is defined as RAGState, and three nodes form the main chain retrieve → generate → guardrail; the guardrail node's conditional routing returns to the generate node when it does not pass and the retry count is less than 2.
Bounded retry maintains a retry counter in the StateGraph state object, and when the counter exceeds a preset threshold (e.g., 3), a conditional edge routes the process to a termination node that returns "I don't know," preventing infinite recursion.
LongGuard embeds into StateGraph and evaluates four failure modes at sub-millisecond speed at every step of the agent: identical tool calls, semantic oscillation, dead-end drift, and token rate.
All Facts (7)
The StateGraph design of LangGraph is rooted in Finite State Machine (FSM) theory, but extends states to structured data objects rather than discrete enumerated values.
70%UnverifiedLangGraph通过StateGraph维护不可变的状态对象，每次状态变更生成新的状态版本而非原地修改
85%UnverifiedLangGraph's StateGraph mechanism enables agent collaboration through persistent state, where the entire workflow shares a mutable state object that each node reads and updates.
60%UnverifiedIn LangGraph's StateGraph, the parent graph and subgraph each maintain their own state schema, and only keys declared on both sides are passed across the boundary; keys produced by the parent step but not declared in the sub-schema silently disappear on the subgraph side, without throwing an exception or producing a warning log.
50%UnverifiedThe workflow is orchestrated with LangGraph's StateGraph, the state is defined as RAGState, and three nodes form the main chain retrieve → generate → guardrail; the guardrail node's conditional routing returns to the generate node when it does not pass and the retry count is less than 2.
50%UnverifiedBounded retry maintains a retry counter in the StateGraph state object, and when the counter exceeds a preset threshold (e.g., 3), a conditional edge routes the process to a termination node that returns "I don't know," preventing infinite recursion.
50%UnverifiedLongGuard embeds into StateGraph and evaluates four failure modes at sub-millisecond speed at every step of the agent: identical tool calls, semantic oscillation, dead-end drift, and token rate.
50%