Struct StateGraph 

pub struct StateGraph {
    pub nodes: HashMap<String, DynNode>,
    pub edges: Vec<Edge>,
    pub conditional_edges: Vec<ConditionalEdge>,
    pub entry_point: Option<String>,
}

StateGraph - fluent builder for creating DAGs

Fields

nodes: HashMap<String, DynNode>

edges: Vec<Edge>

conditional_edges: Vec<ConditionalEdge>

entry_point: Option<String>

Implementations

impl StateGraph

pub fn new() -> Self

Create a new empty graph

pub fn add_node<F, Fut>(self, name: impl Into<String>, func: F) -> Self

where F: Fn(NodeState) -> Fut + Send + Sync + 'static, Fut: Future<Output = Result<NodeState>> + Send + 'static,

Add a node with a function

pub fn add_node_impl(self, node: impl Node + 'static) -> Self

Add a pre-built node

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

Add a direct edge between two nodes

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

Add an edge to END

pub fn add_conditional_edge<F>(self, from: impl Into<String>, router: F) -> Self

where F: Fn(&str) -> EdgeTarget + Send + Sync + 'static,

Add a conditional edge with a router function

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

Set the entry point node

pub fn compile(self) -> Result<CompiledGraph>

Compile the graph for execution

Trait Implementations

impl Default for StateGraph

fn default() -> Self

Returns the “default value” for a type.