Class Graph

A compiled workflow graph. Nodes are inferred (deduped by identity) from the edges.

Mirrors google/adk-python workflow/_graph.py::Graph.

Constructors

constructor

new Graph(edges: Edge[]): Graph
Parameters
- edges: Edge[]
Returns Graph
- Defined in core/src/workflow/graph.ts:129

Properties

`Readonly`edges

edges: Edge[]

`Readonly`nodes

nodes: BaseNode<unknown, unknown>[]

Accessors

terminalNodeNames

get terminalNodeNames(): ReadonlySet<string>
Terminal node names (no outgoing edges); populated by validate.

Returns ReadonlySet<string>
- Defined in core/src/workflow/graph.ts:145

Methods

getNextPendingNodes

getNextPendingNodes(
nodeName: string,
routesToMatch: RouteValue | RouteValue[] | null | undefined,
): string[]
Determines the next nodes to transition to PENDING based on the route(s) emitted by a completed node. Ported from Python get_next_pending_nodes.

Logs at debug when the node emitted a route, has conditional outgoing edges, and none of them (nor a DEFAULT_ROUTE edge) matched — the branch stops there, which is easy to mistake for a bug. Behaviour is unchanged.
Parameters
- nodeName: string
- routesToMatch: RouteValue | RouteValue[] | null | undefined
Returns string[]
- Defined in core/src/workflow/graph.ts:157

validate

validate(): void
Validates the graph and computes terminal node names.

Returns void
- Defined in core/src/workflow/graph.ts:254