← All blueprints

LLMCompiler LangGraph

blueprint · 3 agents
20000★ stars

What it does

An implementation of the LLMCompiler paper in LangGraph: instead of one step at a time, the planner emits a whole dependency graph of tool calls, a task-fetching unit schedules them eagerly in parallel, and a joiner reviews results to respond or loop. The pattern for latency-optimal tool use.

Agent flow

1 · Planner
Stream the task DAG
no tools · reasoning
2 · Workers
Execute in parallel
search, math
3 · Joiner
Finish or replan
no tools · reasoning
get the code
View the source on GitHub ↗

This blueprint lives in its authors' repository. SocketCat indexes it and links you to the real thing.

More in Core patterns

Browse all →

Supervisor Team

com.socketcat/supervisor-team
LangGraph

A supervisor decides who works next — a researcher who searches or a coder who edits the repo — and assembles the result when the work is done.

★ 21402 servers
⑂ 312

Deep Research

com.socketcat/deep-research
LangGraph

Splits a hard question into sub-questions, researches them in parallel to keep the wall-clock low, then synthesizes one brief with citations.

★ 17551 server
⑂ 254

Agentic RAG

com.socketcat/agentic-rag
LangGraph

Retrieval that doesn't trust its first search: it grades the results, rewrites the query when they're weak, and only answers once the context is good.

★ 16801 server
⑂ 241