Struct PlanGraph 

pub struct PlanGraph {
    pub deliverables: Vec<Deliverable>,
    pub max_chained_dispatch: Option<u32>,
}

Full plan submitted to crate::ports::Planner::submit_plan.

A plan is a DAG of Deliverables connected by the prerequisites field. The Planner is responsible for detecting cycles, missing prerequisite references, and duplicate ids; on any structural problem it returns PlannerError::InvalidGraph with a precise reason.

Fields

deliverables: Vec<Deliverable>

Every deliverable in the plan. Order is irrelevant; the Planner derives execution order from the prerequisites edges.

max_chained_dispatch: Option<u32>

Optional global guardrail: maximum number of deliverables that may be dispatched in one chained sequence before the orchestrator must pause for explicit re-prompt. None means no limit. Carried at the graph level rather than per-deliverable because it reflects an operator policy, not a property of any single task.

Trait Implementations

impl Clone for PlanGraph

fn clone(&self) -> PlanGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PlanGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for PlanGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for PlanGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.