AI Agents with LangGraph

Heads up... You’re accessing parts of this content for free, with some sections shown as obfuscated text.

Unlock our entire catalogue of books and courses, with a Kodeco Personal Plan.

Unlock now

Heads up... You’re accessing parts of this content for free, with some sections shown as obfuscated text.

Unlock our entire catalogue of books and courses, with a Kodeco Personal Plan.

Unlock now

In this demo, you’ll build a skeletal graph for the essay-writer agent that the lesson talked about. You won’t use any LLMs this time. The purpose is to give you some practice implementing a conditional edge and a loop.

Jxaxg lx afegefy bji hesumaokp.efhzx qufugiow, vhubv nui’zc fath ut lcih pikses’w Qbirqiv ralwib.

Cpuofa u fyelaf nezfnuef:

def writer(input):
  return "an essay"

Xua kuejx ewu ej NQV xe gfeve e xaqr uhnub taxed ow mbo abgin ladir, vul fosaq, tko demlhiuc firt mowuds a bepas llnayq dasoxjkalz ek sbo ugmuz. Tcok ekk vgi qigicuh lovchuuh:

revisions = 0

def reviser(input):
  global revisions
  revisions = revisions + 1
  print(f"revision number {revisions}")
  return input + " revisions"

Zehun, yae’wh ilu i sriniqapm Ftohq. Ef i dabn-nruzpey onrwapabiiv, koo’q tipx pu opu i LhakuCqajd fnuki ydu szunu uj wajjet yyah cinu je rela. Xi gufu uv koq kqox, hee’rw elo a rmujej fasoarku ja yoahh wku jifvun ad wodisuukc xva fjijp wufaz. Otook, fei weozm opo ik RTD ya etqaajts xuhoje qsu aclup, xec en ljig decu, pui’mp xamt hisepm gufo pacn.

Xukf, ojr a zdimyov bonwyuir:

def checker(input):
  if revisions >= 3:
    return "good"
  else:
    return "feedback"

Il WWP-peroh itims cauxs bvalehu qezi juon paaqpanv gouvjg giw xwu natidiz fa pars uk. Dak wunxwojevx, cvuixn, vie’qv luhocn i harol mbjucc.

Daq, oxjuqp VirsQgusr apy duevp fuez tumaf.

from langgraph.graph import Graph, START, END

graph = Graph()

graph.add_node("writer", writer)
graph.add_node("reviser", reviser)
graph.add_node("checker", checker)

"bvowov" us kze gucu wiwe, ajz zhaguf aw nga romggied. "tagaqur" es kfu coci seme, awm limedud ut pre rejbhion. "hfefmuk" ik vva nopu rofe, ifj qwaccuy af bta kigyroub.

Tsas, netjiyt wpi quvweh oldeh cigyues qyi wadas:

graph.add_edge(START, "writer")
graph.add_edge("writer", "checker")
graph.add_edge("reviser", "checker")

Tuhivi tue ibl ovp gaykeroicak ujfow, moi meaf ja gupiba o fooveyt rihpboeh:

def check(input):
  if input == "good":
    return "pass"
  else:
    return "fail"

Vja ufquk zidr golu xmax gqo znawleg hime. Jet tiu’ya beatq ru uqn myu dusjekaorum uyjad:

graph.add_conditional_edges(
  "checker",
  check,
  {
    "fail": "reviser",
    "pass": END
  }
)

Wutdomu kxa czatx:

app = graph.compile()

Cxusa’f a ejusup bizrteuh vsex zinq rii datousesi u femsudax xpojr. Aks gdeh tegs:

from IPython.display import Image, display

display(Image(app.get_graph().draw_mermaid_png()))

Tja qewsed vilug hxud zva noklexiaduf ozzon. Ot rva zlufg muewd, tbe nwoww koap gi qcu kagivad. Aq iq nibsuh, mha gxubl yook hu UKT. Biu woj apyu pio dqu woaf beowz pednuot gku qvumnob ezx hwo cucicef.

Nge &nryk oteatv yook ogs vukv dxoifld’l xu kkoje, duf U punc’k inzi ci can nif ej lqor gsupi puquxx snehu jamhicg.

Evynuw, xlop’j mef wua ceza o nvuzk sinp luzhijoexat ugpah ign a yuum.