# ಕಲ್ಪನೆಯನ್ನು ವಿವರಿಸಲು ಸೂಡೊಕೋಡ್ ತರಹದ ಉದಾಹರಣೆ
from langgraph import StateGraph, Node, Edge
state = {"query": None, "docs": [], "draft": None, "confidence": 0.0}
plan = Node(lambda s: s.update(plan=plan_with_llm(s["query"])) or s)
retrieve = Node(lambda s: s.update(docs=search_tools(s["plan"])) or s)
write = Node(lambda s: s.update(draft=llm_write(s["docs"])) or s)
verify = Node(lambda s: s.update(confidence=grade(s["draft"])) or s)
edges = [
 Edge(plan, retrieve),
 Edge(retrieve, write),
 Edge(write, verify),
 Edge(verify, retrieve, condition=lambda s: s["confidence"] < 0.8), # retry loop
]
graph = StateGraph(state, nodes=[plan, retrieve, write, verify], edges=edges)
result_state = graph.run({"query": "Summarize LangGraph"})