Single node
One function receives state, does a job, and returns an update.
Graph I & IILangGraph clicks when you can see how state moves. Explore five small graphs, then follow the same patterns into tools, memory, and RAG.
01 / The foundation
Graph II adds richer input to a single-node graph. The others change the route that state takes.
One function receives state, does a job, and returns an update.
Graph I & IIEach node uses the state produced by the one before it.
Graph IIIA routing function chooses which node runs next.
Graph IVA conditional edge repeats a node until a stop rule is met.
Graph V02 / Interactive graph lab
Choose a graph, then move through its execution. The highlighted node and state snapshot show what just happened.
The smallest possible LangGraph flow: read state, update it once, then finish.
State begins with a single field: the name to greet.
A node is a Python function. The graph determines when it runs.
03 / The crucial distinction
Graph IV is where the course moves from a fixed sequence to a graph that chooses its next step.
routerA named node receives the state. In this example it does no arithmetic.
decide_next_nodeThe routing function reads operation and returns a route label.
add_node or subtract_nodeThe route map sends execution to exactly one calculation node.
The calculation changes, but the graph still takes the same path.
The path itself changes. Only the selected operation node runs.
04 / From graph to agent
Once state and routing make sense, the rest of the video adds model calls and tools to those same paths.
A model sits inside one node and answers a human message.
Earlier human and AI messages are sent again so later replies have context.
The model requests a tool. The tool returns a result. The model decides whether to continue.
A person reviews the draft, requests changes, and finishes by saving it.
05 / Final project
The last agent uses retrieval as a tool. A question leads to relevant PDF passages, then to a response informed by those passages.
The learning check: Compare the answer with the actual PDF passage. A retrieval result can be irrelevant, and a fluent answer can still be wrong.
Watch RAG lesson ↗Make it stick
After each graph, predict its final state, recreate its edges, then explain why it reaches that result. That is the fastest way to turn the course into working knowledge.