Struct Graph 

pub struct Graph {
    pub id: String,
    pub name: String,
    pub nodes: HashMap<String, GraphNode>,
    pub edges: Vec<GraphEdge>,
    pub entry_node: String,
    pub config: GraphConfig,
    pub checkpoint_store: Option<Arc<dyn CheckpointStore>>,
}

The main graph structure

Fields

id: String

Graph ID

name: String

Graph name

nodes: HashMap<String, GraphNode>

Nodes in the graph

edges: Vec<GraphEdge>

Edges in the graph

entry_node: String

Entry node ID

config: GraphConfig

Configuration

checkpoint_store: Option<Arc<dyn CheckpointStore>>

Checkpoint store

Implementations

impl Graph

pub async fn invoke( &self, initial_state: GraphState, ) -> Result<GraphResult, CrewError>

Execute the graph with initial state

pub async fn resume( &self, checkpoint_id: &str, ) -> Result<GraphResult, CrewError>

Resume from a checkpoint

pub fn find_next_node( &self, current: &str, state: &GraphState, ) -> Result<String, CrewError>

Find the next node based on edges

pub fn stream(&self, initial_state: GraphState) -> GraphStream<'_>

Stream execution, yielding state after each node

pub fn to_mermaid(&self) -> String

Get a visual representation of the graph (Mermaid format)

Trait Implementations

impl Debug for Graph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.