Generate graph code from DSL for LangGraph framework
Project description
langgraph-codegen
Generates python code for parts of langgraph
from langgraph_codegen import gen_graph
graph_spec = """
# required: start with StateClass and first_node
START(StateClass) => first_node
first_node
should_go_to_second => second_node
=> third_node
second_node => third_node
third_node => END
"""
graph_code = gen_graph("my_graph", graph_spec)
print(graph_code)
Output is:
# GENERATED code, creates compiled graph: my_graph
my_graph = StateGraph(StateClass)
my_graph.add_node('first_node', first_node)
my_graph.add_node('should_go_to_second', should_go_to_second)
my_graph.add_node('second_node', second_node)
my_graph.add_node('third_node', third_node)
my_graph.add_edge(START, 'first_node')
my_graph.add_edge('should_go_to_second', 'second_node')
my_graph.add_edge('should_go_to_second', 'third_node')
my_graph.add_edge('second_node', 'third_node')
my_graph.add_edge('third_node', END)
my_graph = my_graph.compile()
Syntax
START(StateClass) => first_node
required
# anything after pound sign is ignored
node_1 => node_2
unconditional edge
node_X
condition_A => node_Y
condition_B => node_Z
=> END # unconditional if all above conditions fail
node_1 => node_2, node_3
ok to transition to multiple nodes
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Close
Hashes for langgraph_codegen-0.1.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | a81d2357f735002773f7347fa44b86cfe33f005e151a9b850e86455ddc701c3b |
|
MD5 | 11d3be86d34ec033691297a9c748e1e0 |
|
BLAKE2b-256 | 36ad0184b39b2b854ff4a4de5255a75422f2fb7772cad71186d98293ceaa1eaf |