Struct WorkflowGraph 

pub struct WorkflowGraph { /* private fields */ }

The main workflow graph that orchestrates node execution

Implementations

impl WorkflowGraph

pub fn new(name: impl Into<String>) -> Self

Create a new workflow graph

pub fn with_description(self, description: impl Into<String>) -> Self

Set the graph description

pub async fn add_node( &mut self, node_id: impl Into<NodeId>, node: Arc<dyn Node>, ) -> RGraphResult<()>

Add a node to the graph

pub fn add_edge( &mut self, from: impl Into<NodeId>, to: impl Into<NodeId>, ) -> RGraphResult<EdgeId>

Add an edge between two nodes

pub fn add_edge_with_condition( &mut self, from: impl Into<NodeId>, to: impl Into<NodeId>, condition: EdgeCondition, ) -> RGraphResult<EdgeId>

Add an edge with a condition

pub fn add_conditional_edge<F>( &mut self, from: impl Into<NodeId>, _condition_fn: F, ) -> RGraphResult<EdgeId>

where F: Fn(&GraphState) -> RGraphResult<String> + Send + Sync + 'static,

Add a conditional edge with a custom routing function

pub fn set_entry_points(&mut self, entry_points: Vec<NodeId>)

Set entry points for the graph

pub fn set_exit_points(&mut self, exit_points: Vec<NodeId>)

Set exit points for the graph

pub fn id(&self) -> &str

Get the graph ID

pub fn name(&self) -> &str

Get the graph name

pub fn description(&self) -> Option<&str>

Get the graph description

pub fn node_ids(&self) -> Vec<NodeId>

Get all node IDs in the graph

pub fn entry_points(&self) -> Vec<NodeId>

Get entry points (returns owned values to avoid lifetime issues)

pub fn entry_points_owned(&self) -> Vec<NodeId>

Get entry points as owned values

pub fn get_node(&self, node_id: &NodeId) -> Option<Arc<dyn Node>>

Get a node by ID

pub fn validate(&self) -> RGraphResult<()>

Validate the graph structure