Struct Graph 

pub struct Graph {
    pub entry: String,
    pub nodes: Vec<Node>,
    pub edges: Vec<Edge>,
}

The bare execution graph: an entry node, a node list, and an edge list.

Deserialised via serde and validated via Graph::validate.

Fields

entry: String

nodes: Vec<Node>

edges: Vec<Edge>

Implementations

impl Graph

pub fn node(&self, id: &str) -> Option<&Node>

Look up a node by id.

pub fn edges_from(&self, id: &str) -> impl Iterator<Item = &Edge>

Outgoing edges for a node, in declaration order.

pub fn edges_to(&self, id: &str) -> impl Iterator<Item = &Edge>

Incoming edges for a node.

pub fn validate(&self, schema_version: u32) -> Result<(), String>

Validate the graph.

schema_version is passed in so that v2-only node kinds can be rejected when the document declares schemaVersion: 1.

Rules (v1 + v2)

1. Node ids must be unique.
2. entry names an existing node.
3. Every edge endpoint names an existing node.
4. Agent and Tool nodes have exactly one outgoing edge.
5. Router nodes have both a "loop" and a "resolved" branch edge.
6. Respond nodes have zero outgoing edges.
7. (v2) v2-kind nodes in a schemaVersion-1 document are rejected.
8. (v2) Supervisor: ≥2 routes; unique branch labels; every route has exactly one matching outgoing edge; no extra outgoing edges.
9. (v2) Parallel: ≥2 outgoing edges, all with unique branch labels; every branch reaches the same join node; branches are node-disjoint before the join; no nested parallel; no respond inside a branch.
10. (v2) Join: ≥2 incoming edges; exactly 1 outgoing edge; only reachable via a parallel node.
11. (v2) Approval: ≥1 outgoing edge (branch labels are validated leniently — any of approved/denied/timeout is accepted).

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Graph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for Graph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.