Struct Graph 

pub struct Graph<State, Deps = (), End = ()>
where
    State: GraphState,
{
    pub nodes: HashMap<String, NodeDef<State, Deps, End>>,
    /* private fields */
}

A graph for multi-agent workflows.

Fields

nodes: HashMap<String, NodeDef<State, Deps, End>>

Nodes in the graph.

Implementations

impl<State, Deps, End> Graph<State, Deps, End>

where State: GraphState, Deps: Send + Sync + 'static, End: Send + Sync + 'static,

pub fn new() -> Self

Create a new empty graph.

pub fn with_name(self, name: impl Into<String>) -> Self

Set the graph name.

pub fn with_max_steps(self, max: u32) -> Self

Set maximum steps.

pub fn without_instrumentation(self) -> Self

Disable auto instrumentation.

pub fn node<N>(self, name: impl Into<String>, node: N) -> Self

where N: BaseNode<State, Deps, End> + 'static,

Add a node to the graph.

pub fn edge<F>( self, from: impl Into<String>, to: impl Into<String>, condition: F, ) -> Self

where F: Fn(&State) -> bool + Send + Sync + 'static,

Add an edge with a condition.

pub fn edge_always(self, from: impl Into<String>, to: impl Into<String>) -> Self

Add an unconditional edge.

pub fn entry(self, name: impl Into<String>) -> Self

Set the entry node.

pub fn finish(self, names: &[&str]) -> Self

Set finish nodes.

pub fn add_finish(self, name: impl Into<String>) -> Self

Add a finish node.

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

Get the graph name.

pub fn node_names(&self) -> impl Iterator<Item = &str>

Get node names.

pub fn node_count(&self) -> usize

Get node count.

pub fn edge_count(&self) -> usize

Get edge count.

pub fn edges(&self) -> &[Edge<State>]

Get edges.

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

Validate the graph configuration.

pub fn build(self) -> GraphResult<Self>

Build and validate the graph.

impl<State, Deps, End> Graph<State, Deps, End>

where State: GraphState, Deps: Clone + Send + Sync + 'static, End: Clone + Send + Sync + 'static,

pub async fn run( &self, state: State, deps: Deps, ) -> GraphResult<GraphRunResult<State, End>>

Run the graph from the entry node.

pub async fn run_with_options( &self, state: State, deps: Deps, options: ExecutionOptions, ) -> GraphResult<GraphRunResult<State, End>>

Run the graph from the entry node with options.

pub async fn run_from<N>( &self, start: &N, state: State, deps: Deps, ) -> GraphResult<GraphRunResult<State, End>>

where N: BaseNode<State, Deps, End> + ?Sized,

Run the graph from a specific node.

pub async fn run_from_with_options<N>( &self, start: &N, state: State, deps: Deps, options: ExecutionOptions, ) -> GraphResult<GraphRunResult<State, End>>

where N: BaseNode<State, Deps, End> + ?Sized,

Run the graph from a specific node with options.

Trait Implementations

impl<State, Deps, End> Default for Graph<State, Deps, End>

where State: GraphState, Deps: Send + Sync + 'static, End: Send + Sync + 'static,

fn default() -> Self

Returns the “default value” for a type.