Walk the agent tree from root, computing each reachable node's effective (intersected) scope and every per-edge
escalation. Cycle-guarded (lint rejects cycles independently); on a DAG/tree each node's effective is its first
reaching path's intersection — sufficient for the shallow agent graphs C027 ships.
Walk the agent tree from
root, computing each reachable node's effective (intersected) scope and every per-edge escalation. Cycle-guarded (lint rejects cycles independently); on a DAG/tree each node's effective is its first reaching path's intersection — sufficient for the shallow agent graphs C027 ships.