Struct StateGraph 

pub struct StateGraph<S: StateSchema> { /* private fields */ }

StateGraph - Main graph builder

Manages nodes, edges, and state schema for graph execution. After building, compile to get an executable CompiledGraph.

Implementations

impl<S: StateSchema + 'static> StateGraph<S>

pub fn new() -> Self

Create a new empty state graph.

pub fn add_node<N: GraphNode<S> + 'static>(&mut self, node: N) -> &mut Self

Add a node to the graph.

pub fn add_node_fn<F>(&mut self, name: impl Into<String>, func: F) -> &mut Self

where F: Fn(&S) -> Result<StateUpdate<S>, GraphError> + Send + Sync + 'static,

Add a synchronous function node to the graph.

pub fn add_async_node<F>( &mut self, name: impl Into<String>, func: F, ) -> &mut Self

where F: AsyncFn<S> + 'static,

Add an async function node to the graph.

pub fn add_subgraph<SubS: StateSchema + 'static>( &mut self, name: impl Into<String>, subgraph: CompiledGraph<SubS>, input_mapper: impl Fn(&S) -> SubS + Send + Sync + 'static, output_mapper: impl Fn(&SubS, &mut S) + Send + Sync + 'static, ) -> &mut Self

Add a subgraph node with input/output mappers.

pub fn add_subgraph_same_state( &mut self, name: impl Into<String>, subgraph: CompiledGraph<S>, ) -> &mut Self

Add a subgraph node that shares the same state type.

pub fn add_edge( &mut self, source: impl Into<String>, target: impl Into<String>, ) -> &mut Self

Add a fixed edge between two nodes.

pub fn add_conditional_edges( &mut self, source: impl Into<String>, router_name: impl Into<String>, targets: HashMap<String, String>, default: Option<String>, ) -> &mut Self

Add a conditional edge routed by a named router.

pub fn add_fan_out( &mut self, source: impl Into<String>, targets: Vec<String>, ) -> &mut Self

Add a FanOut edge for parallel execution.

pub fn add_fan_in( &mut self, sources: Vec<String>, target: impl Into<String>, ) -> &mut Self

Add a FanIn edge joining multiple sources into one target.

pub fn set_conditional_router<R: ConditionalEdge<S> + 'static>( &mut self, name: impl Into<String>, router: R, ) -> &mut Self

Register a conditional routing function by name.

pub fn set_entry_point(&mut self, node: impl Into<String>) -> &mut Self

Set the entry point node for the graph.

pub fn set_reducer( &mut self, field: impl Into<String>, reducer: Arc<dyn Reducer<S>>, ) -> &mut Self

Register a reducer for a specific state field.

pub fn compile(&self) -> GraphResult<CompiledGraph<S>>

Compile the graph into an executable CompiledGraph.

Trait Implementations

impl<S: StateSchema + 'static> Default for StateGraph<S>

fn default() -> Self

Returns the “default value” for a type.