Skip to main content
Terminates a graph or subgraph and exposes the final result.

​
Result handling

The value arriving on the input port is published as the graph’s result and the engine halts further evaluation. End nodes do not have an output port; downstream consumers read the result from the engine context.

​
Multiplicity

Every graph must contain at least one End node, otherwise evaluation raises. A graph may save and prepare without one, but cannot run. If multiple End nodes are reachable, the first one encountered during evaluation wins and the rest are ignored - branching paths that can reach more than one End produce non-deterministic results and should be avoided.

​
Ports