Struct WorkflowGraph 

pub struct WorkflowGraph { /* private fields */ }

Validated graph-level workflow structure.

Implementations

impl WorkflowGraph

pub fn new( nodes: impl Into<Vec<NodeDefinition>>, edges: impl Into<Vec<EdgeDefinition>>, ) -> Result<Self, WorkflowValidationError>

Create and validate a workflow graph.

Errors

Returns an error when nodes or ports are duplicated, when an edge references an undeclared node or the wrong port direction, or when the graph contains a directed cycle.

pub fn with_cycles_allowed( nodes: impl Into<Vec<NodeDefinition>>, edges: impl Into<Vec<EdgeDefinition>>, ) -> Result<Self, WorkflowValidationError>

Create and validate a workflow graph while allowing cycles.

Errors

Returns an error when nodes or ports are duplicated, or when an edge references an undeclared node or the wrong port direction.

pub const fn empty() -> Self

Create an empty graph with no nodes or edges.

pub fn nodes(&self) -> &[NodeDefinition]

Declared nodes in stable workflow order.

pub fn edges(&self) -> &[EdgeDefinition]

Declared edges in stable workflow order.

pub fn topological_order(&self) -> Result<Vec<NodeId>, WorkflowValidationError>

Return a deterministic topological order for the nodes in this graph.

Errors

Returns an error when the graph is structurally invalid or contains a directed cycle.

Trait Implementations

impl Clone for WorkflowGraph

fn clone(&self) -> WorkflowGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WorkflowGraph

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

Formats the value using the given formatter.

impl PartialEq for WorkflowGraph

fn eq(&self, other: &WorkflowGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for WorkflowGraph

impl StructuralPartialEq for WorkflowGraph