rexis-graph 0.1.0

Rexis Graph - Graph-based agent orchestration with hybrid state management and memory integration
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128

//! # Routing System
//!
//! Conditional routing and decision-making for graph execution.

use crate::core::NodeId;
use crate::state::GraphState;
use crate::RGraphResult;
use async_trait::async_trait;

#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};

/// Routing decision result
#[derive(Debug, Clone)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub enum RoutingDecision {
    /// Route to specific node
    Route(NodeId),
    /// Stop execution
    Stop,
    /// Continue with default routing
    Continue,
}

/// Trait for routing conditions
#[async_trait]
pub trait RoutingCondition: Send + Sync {
    /// Evaluate the condition and return routing decision
    async fn evaluate(&self, state: &GraphState) -> RGraphResult<RoutingDecision>;
}

/// Simple state-based routing condition
pub struct StateCondition {
    key: String,
    expected_value: serde_json::Value,
    target_node: NodeId,
}

impl StateCondition {
    pub fn new(
        key: impl Into<String>,
        expected_value: serde_json::Value,
        target_node: impl Into<NodeId>,
    ) -> Self {
        Self {
            key: key.into(),
            expected_value,
            target_node: target_node.into(),
        }
    }
}

#[async_trait]
impl RoutingCondition for StateCondition {
    async fn evaluate(&self, state: &GraphState) -> RGraphResult<RoutingDecision> {
        match state.get(&self.key) {
            Ok(value) => {
                let state_json: serde_json::Value = value.into();
                if state_json == self.expected_value {
                    Ok(RoutingDecision::Route(self.target_node.clone()))
                } else {
                    Ok(RoutingDecision::Continue)
                }
            }
            Err(_) => Ok(RoutingDecision::Continue),
        }
    }
}

/// Conditional edge with routing logic
pub struct ConditionalEdge {
    condition: Box<dyn RoutingCondition>,
    source: NodeId,
}

impl ConditionalEdge {
    pub fn new(source: impl Into<NodeId>, condition: Box<dyn RoutingCondition>) -> Self {
        Self {
            condition,
            source: source.into(),
        }
    }

    pub async fn evaluate(&self, state: &GraphState) -> RGraphResult<RoutingDecision> {
        self.condition.evaluate(state).await
    }
}

/// Router for managing conditional routing
pub struct Router {
    conditions: Vec<ConditionalEdge>,
}

impl Router {
    pub fn new() -> Self {
        Self {
            conditions: Vec::new(),
        }
    }

    pub fn add_condition(&mut self, condition: ConditionalEdge) {
        self.conditions.push(condition);
    }

    pub async fn route(
        &self,
        current_node: &NodeId,
        state: &GraphState,
    ) -> RGraphResult<RoutingDecision> {
        for condition in &self.conditions {
            if &condition.source == current_node {
                let decision = condition.evaluate(state).await?;
                match decision {
                    RoutingDecision::Continue => continue,
                    _ => return Ok(decision),
                }
            }
        }

        Ok(RoutingDecision::Continue)
    }
}

impl Default for Router {
    fn default() -> Self {
        Self::new()
    }
}