Detailed Description

Worst-case resource floors implied by one finite typed Program tree.

These counts are structural: branches choose their largest path, parallel and race sum live work, and bounded loop/retry/map bodies are multiplied. They intentionally do not infer unbounded Core-node behavior.

Definition at line 200 of file plan.h.

The documentation for this struct was generated from the following file:

include/neograph/program/plan.h