Module graph 

Graph topology: nodes, pins, and declarative edges.

A BspGraph is the compiled blueprint the engine runs: re-executable nodes, edges as data (each carrying a declarative Condition), static inputs, and the consumer’s named-condition / merger registries. The fluent builder here is the primary authoring API; crate::def::GraphDef is the serializable interchange format derived from it.

Structs

BspGraph

The blueprint definition containing nodes, edges, and initial inputs.

Edge

A declarative connection between two nodes — data, not a closure.

EdgeBuilder

Builder handle for configuring a freshly added edge, e.g. graph.add_edge(a, b).when(Condition::Named("has_more".into())).with_max_iterations(30).

InputPin

An input pin on a specific node.

NodeHandle

A legacy non-generic identifier wrapping a designated node with port-link builder logic.

OutputPin

An output pin on a specific node.

TypedNodeHandle

A compile-time type-safe identifier wrapping a designated node. This allows compiler-checked, named port accessors generated by macro attributes.

Constants

ERROR_PORT

The value-store port a failing node writes its error to when its recovery policy routes to an error edge (dataflow profile; see crate::recovery::RecoveryPolicy::RouteToErrorEdge).

Type Aliases

EdgeId

Edge identifier: the edge’s index in declaration order.

NodeId

Programmatic node identifier: positional, stable within one graph build.

PortIndex

A port index on a node (dataflow profile).