Interface: PlanInput
Defined in: packages/core/src/graph/plan.ts:13
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:23
Directed edges. Order matters for multi-predecessor nodes — see the class comment on determinism.
nodes
nodes:
Iterable<string>
Defined in: packages/core/src/graph/plan.ts:19
All node ids in the graph. Iterable so the fluent API can hand in a
Set and the config form can hand in Object.keys(nodes).
output?
optionaloutput?:string
Defined in: packages/core/src/graph/plan.ts:27
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:15
Root node that receives the graph's outer input.