---
url: >-
  https://adk.nht.io/api/@nhtio/adk/batteries/orchestration/plan/functions/entryNodes.md
---

# Function: entryNodes()

```ts
function entryNodes(view: RawPlanView | PlanGraphView): PlanNode[];
```

Defined in: [src/batteries/orchestration/plan.ts:151](https://github.com/NHTIO/ADK/blob/v1.20260906.0/src/src/batteries/orchestration/plan.ts#L151)

Every node of kind `'entry'`.

## Parameters

| Parameter | Type                                                                                                           | Description          |
| --------- | -------------------------------------------------------------------------------------------------------------- | -------------------- |
| `view`    | | [`RawPlanView`](../../types/interfaces/RawPlanView.md) | [`PlanGraphView`](../interfaces/PlanGraphView.md) | The graph to search. |

## Returns

[`PlanNode`](../../types/type-aliases/PlanNode.md)\[]

Every node whose `kind` is `'entry'`, in view order.

## Remarks

Whether exactly one exists is WP 04's rule, not this function's. The executor calls this to
find what to materialise; the freeze validator calls it to enforce the exactly-one invariant.
Returning an array (rather than a single node) keeps this a pure question about the graph and
lets the caller decide what a count of zero or more than one means.