Spaces:
Running
Running
File size: 9,239 Bytes
e051bfe | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 | """LangGraph StateGraph assembly + streaming entry point.
Pipeline:
planner โ skill_router โ executor โ reflector โโ
โ โ โ โ
โ โ โโโ reflects: enough? โ
โ โ โ
โ โโโโโ hint: skip LLM, use plan step โ
โ โ
โโโโโโโโโโโ plan exhausted + need_more โโโโโโโ
โ
โ
synthesizer โ END
The planner runs once at the start to pre-decompose the question
into a sequence of plan steps. The skill router then walks through
the plan without re-asking the LLM, with the reflector deciding
when to stop or when to trigger a re-plan.
"""
from __future__ import annotations
import logging
from collections.abc import AsyncIterator
from typing import Any, cast
from langgraph.graph import END, StateGraph
from app.agent.nodes.executor import executor_node
from app.agent.nodes.planner import planner_node
from app.agent.nodes.reflector import reflector_node
from app.agent.nodes.skill_router import skill_router_node
from app.agent.nodes.synthesizer import synthesize
from app.agent.state import EV_DONE, EV_ERROR, AgentState
from app.config import get_settings
from app.skills.registry import REGISTRY
logger = logging.getLogger(__name__)
def _build_graph() -> Any:
g = StateGraph(AgentState)
g.add_node("planner", planner_node)
g.add_node("skill_router", skill_router_node)
g.add_node("executor", executor_node)
g.add_node("reflector", reflector_node)
g.add_node("synthesizer", lambda s: s) # placeholder; streaming handled outside
g.set_entry_point("planner")
g.add_edge("planner", "skill_router") # planner always feeds into the router
# Router explicitly says whether it scheduled a fresh tool call, skipped a
# plan step, or finished. Never infer this from `tool_calls`: doing so made
# a skipped step execute the last completed tool for a second time.
def _after_router(state: AgentState) -> str:
action = state.get("router_action", "finish")
if action == "execute":
return "executor"
if action == "continue":
return "skill_router"
return "synthesizer"
g.add_conditional_edges(
"skill_router",
_after_router,
{
"executor": "executor",
"skill_router": "skill_router",
"synthesizer": "synthesizer",
},
)
# After executor: exactly one reflection takes place for each Skill
# response. The reflector decides whether the next decomposed sub-task is
# necessary before the router can schedule it.
g.add_edge("executor", "reflector")
# After reflector: continue only while the hard Skill-call budget remains.
def _after_reflector(state: AgentState) -> str:
verdict = state.get("reflection_verdict", "sufficient")
calls_used = state.get("skill_calls_used", len(state.get("tool_calls", [])))
max_calls = get_settings().agent_max_skill_calls
if verdict == "need_more" and calls_used < max_calls:
plan = state.get("plan") or []
if not plan:
# Plan was cleared (exhausted) โ re-plan with all evidence.
return "planner"
return "skill_router"
return "synthesizer"
g.add_conditional_edges(
"reflector",
_after_reflector,
{
"planner": "planner",
"skill_router": "skill_router",
"synthesizer": "synthesizer",
},
)
g.add_edge("synthesizer", END)
# Default LangGraph recursion limit is 25. A full 8-call flow can use
# planner/router/executor/reflector nodes multiple times, so reserve room
# for one re-plan without allowing unbounded tool work.
return g.compile()
_GRAPH = None
def get_graph() -> Any:
global _GRAPH
if _GRAPH is None:
_GRAPH = _build_graph()
return _GRAPH
# ---------- Public streaming entry point ----------
async def run_agent_stream(
user_query: str,
history: list[dict[str, Any]],
session_id: str,
run_id: str | None = None,
) -> AsyncIterator[dict[str, Any]]:
"""Stream agent events for a single user turn."""
from app.agent.state import (
EV_REFLECTION,
EV_THINK,
EV_TOOL_CALL,
EV_TOOL_RESULT,
)
from app.utils.trace import generate_trace_id
if not REGISTRY.list_specs():
yield {"event": EV_ERROR, "data": {"message": "No skills registered"}}
yield {"event": EV_DONE, "data": {}}
return
trace_id = generate_trace_id()
init_state: AgentState = {
"user_query": user_query,
"session_id": session_id,
"run_id": run_id or trace_id,
"history": history,
"tool_calls": [],
"skill_calls_used": 0,
"reflection_verdict": "need_more",
"trace_id": trace_id,
"plan": [],
"pending_step_index": 0,
"next_skill_hint": None,
"next_args_hint": None,
"router_action": "continue",
}
yield {
"event": EV_THINK,
"data": {"step": "entry", "text": f"ๅผๅงๅค็๏ผ{user_query}", "trace_id": trace_id},
}
graph = get_graph()
final_state = cast(AgentState, dict(init_state))
try:
async for event in graph.astream(
init_state,
config={"recursion_limit": 50, "configurable": {"thread_id": run_id or trace_id}},
):
# event is dict {node_name: node_output}
for node_name, node_out in event.items():
if not isinstance(node_out, dict):
continue
final_state.update(cast(AgentState, node_out))
# Stream per-node events
if node_name == "planner":
plan = node_out.get("plan") or []
steps = [
f"{s.get('target_skill') or 'final'} ({s.get('goal', '')[:40]})"
for s in plan
]
rationale = node_out.get("rationale", "") or ""
yield {
"event": EV_THINK,
"data": {
"step": "plan",
"text": f"ๅทฒ่งๅ {len(plan)} ๆญฅ๏ผ{' โ '.join(steps)}"
+ (f"\n็็ฑ๏ผ{rationale}" if rationale else ""),
},
}
if node_name == "skill_router":
tc = node_out.get("tool_calls") or []
if node_out.get("router_action") == "execute" and tc:
last = tc[-1]
yield {
"event": EV_TOOL_CALL,
"data": {
"name": last["name"],
"args": last.get("args", {}),
"trace_id": last.get("trace_id", ""),
},
}
if node_out.get("router_action") == "finish":
yield {
"event": EV_THINK,
"data": {"step": "finalize", "text": "ๆฐๆฎๆถ้ๅฎๆ๏ผๆญฃๅจๆฑๆปๆ็ปๅ็ญ"},
}
elif node_name == "executor":
tc = node_out.get("tool_calls") or []
if tc:
last = tc[-1]
yield {
"event": EV_TOOL_RESULT,
"data": {
"name": last["name"],
"ok": last.get("ok", False),
"duration_ms": last.get("duration_ms", 0),
"trace_id": last.get("trace_id", ""),
"result": last.get("result"),
"error": last.get("error"),
},
}
elif node_name == "reflector":
yield {
"event": EV_REFLECTION,
"data": {
"verdict": node_out.get("reflection_verdict", "sufficient"),
"reason": node_out.get("reflection", ""),
},
}
except Exception as exc: # noqa: BLE001
logger.exception("agent graph execution failed")
yield {
"event": EV_ERROR,
"data": {"message": f"Agent ๆง่กๅคฑ่ดฅ: {exc}", "trace_id": trace_id},
}
# All exits, including router guards and failures, go through the one
# synthesizer. This keeps user-facing content separate from execution
# trace and ensures exactly one final-answer event per turn.
async for ev in synthesize(final_state):
yield ev
yield {"event": EV_DONE, "data": {"trace_id": trace_id}}
|