Instructions

Model each subtask as a router advertising link-state costs. Route the plan by cheapest path, not by declared priority.

Example output

Cost(A→B)=3, Cost(A→C→B)=2 → route via C.
Recompute on task-cost change.