Struct DagGraph 

pub struct DagGraph { /* private fields */ }

A parsed and validated directed acyclic graph representing a workflow.

Clone is implemented so the "iteration" node can share one parsed sub-flow DAG across concurrent loop iterations without re-parsing.

Constructed via DagGraph::from_json. After construction the graph is guaranteed to be acyclic and self-consistent (all edge source/target IDs exist).

Implementations

impl DagGraph

pub fn from_json(value: &Value) -> Result<Self>

Parse and validate a flow definition from a JSON value.

The expected shape is a { "nodes": [...], "edges": [...] } object (Dify-compatible format):

{
  "nodes": [
    { "id": "fetch", "type": "http-request", "data": { "url": "https://api.example.com" } },
    { "id": "notify", "type": "noop", "data": { "run_if": { "from": "fetch", "path": "ok", "op": "eq", "value": true } } }
  ],
  "edges": [
    { "source": "fetch", "target": "notify" }
  ]
}

pub fn nodes_in_order(&self) -> impl Iterator<Item = &NodeDef>

Returns node definitions in topological order (dependencies first).

pub fn dependencies_of(&self, id: &str) -> &[String]

Returns the direct dependencies of a node by ID.

Trait Implementations

impl Clone for DagGraph

fn clone(&self) -> DagGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.