Expand description
Serializable graph definitions — the GUI / n8n-enabler.
A GraphDef fully describes a graph as data: nodes (with stable string ids, opaque
consumer-owned config blobs, and inert GUI layout positions), edges (with declarative
conditions and loop budgets), and explicit entries. The fluent BspGraph builder
remains the authoring API; definitions are the interchange format, and
def -> graph -> def is a fixed point (modulo
Custom closures, which serialize as their
label only and fail closed at instantiation unless the label is re-registered as a
named condition).
version has existed since the first serialized file: bump GRAPH_DEF_VERSION on
any breaking format change so old files are never unmarked.
Structs§
- EdgeDef
- A serializable edge definition.
- Graph
Def - A fully serializable graph description.
- NodeDef
- A serializable node definition.
- Static
Input Def - A serializable static input: an initial pin value injected before execution.
Enums§
- Activation
Def - Serializable activation policy:
"any"(control-flow default) or"all"(join). - Condition
Def - The serializable condition subset.
- Recovery
Def - Serializable recovery policy:
"fail_fast","error_edge", or{"retry": {...}}(backoff parameters only — classification never serializes).
Constants§
- GRAPH_
DEF_ VERSION - The current
GraphDefschema version. Bump on any breaking format change.