Skip to main content

Interface: PlanInput

Defined in: packages/core/src/graph/plan.ts:9

Shared topological planner for fluent graphs, portable definitions, and hosts. It validates edges, prunes nodes unreachable from the source, rejects reachable cycles, and selects an explicit output or the unique reachable sink. Predecessor order follows edge declaration order. Display labels never change dependencies or the explicit aliases supplied by a graph definition.

Properties​

edges​

edges: readonly object[]

Defined in: packages/core/src/graph/plan.ts:18

Directed edges. Order matters: it is each multi-predecessor node's predecessor order.


nodes​

nodes: Iterable<string>

Defined in: packages/core/src/graph/plan.ts:14

All node ids in the graph.


output?​

optional output?: string

Defined in: packages/core/src/graph/plan.ts:22

Explicit sink. Required when the reachable graph has multiple sinks; forbidden to be unreachable from source.


source​

source: string

Defined in: packages/core/src/graph/plan.ts:11

Root node that receives the graph's outer input.