Struct DAGWorkflow

pub struct DAGWorkflow {
    pub name: String,
    pub description: String,
    /* private fields */
}

The main orchestration structure

Fields

name: String

The workflow name

description: String

The workflow description

Implementations

impl DAGWorkflow

pub fn new<S: Into<String>>(name: S, description: S) -> Self

Create a new DAGWorkflow

pub fn register_agent(&mut self, agent: Arc<dyn Agent>)

Register an agent with the orchestrator

pub fn connect_agents( &mut self, from: &str, to: &str, flow: Flow, ) -> Result<EdgeIndex, GraphWorkflowError>

Add a flow connection between two agents

pub fn disconnect_agents( &mut self, from: &str, to: &str, ) -> Result<(), GraphWorkflowError>

Remove an agent connection

pub fn remove_agent(&mut self, name: &str) -> Result<(), GraphWorkflowError>

Remove an agent from the orchestrator

pub async fn execute_agent( &self, name: &str, input: String, ) -> Result<String, GraphWorkflowError>

Execute a specific agent

pub async fn execute_workflow( &mut self, start_agents: &[&str], input: impl Into<String>, ) -> Result<DashMap<String, Result<String, GraphWorkflowError>>, GraphWorkflowError>

Execute the entire workflow starting from a specific agent

Arguments

• start_agent: The name of the agent to start the workflow from
• input: The input to the workflow

Returns

• Result<DashMap<String, Result<String, GraphWorkflowError>>, GraphWorkflowError>: A map of agent names to their results

pub fn get_workflow_structure( &self, ) -> HashMap<String, Vec<(String, Option<String>)>>

Get the current workflow as a visualization-friendly format

pub fn export_workflow_dot(&self) -> String

Export the workflow to a format that can be visualized (e.g., DOT format for Graphviz)

pub fn find_execution_paths( &self, start_agents: &[&str], ) -> Result<Vec<Vec<String>>, GraphWorkflowError>

Helper method to find all possible execution paths

pub fn detect_potential_deadlocks(&self) -> Vec<Vec<String>>

Detect potential deadlocks in the workflow. Whether there will actually be a deadlock depends on the flow at execution time.

Info

Maybe we need a monitor to detect deadlocks instead of this function.

Returns

Returns a vector of cycles (each cycle is a vector of agent names).

Example: vec![vec![“A”, “B”, “C”], vec![“X”, “Y”]]