A compiled graph is a node

Florence runs your waves with a supervisor-plus-reviewers orchestration (/reviewed-implementation). This module builds a working toy of it in LangGraph: a supervisor dispatching an implementer subgraph and a reviewer subgraph with a fix loop. You understand the pattern from the inside, and you get a template for LangGraph-native agent teams.

Any graph you .compile() can be added into a parent graph exactly like a plain function node. That is the whole mechanism: composition, not a special API.

const implementer = new StateGraph(ImplState)./*…*/.compile();
const reviewer    = new StateGraph(ReviewState)./*…*/.compile();

const supervisor = new StateGraph(SupervisorState)
  .addNode("implement", implementer)
  .addNode("review", reviewer)
  .addNode("route", routeNode)
  .addEdge(START, "route")
  .compile();

State mapping between parent and child: the subgraph has its own state schema. When the parent invokes it, matching keys flow in and out; keys the subgraph does not declare stay isolated in the parent. This is the important safety property: the implementer’s scratch state does not leak into the reviewer’s, and neither pollutes the supervisor’s.