adk-graph 0.6.0

Graph-based workflow orchestration for ADK-Rust agents
Documentation 
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147

//! Graph construction and compilation tests

use adk_graph::edge::{END, START};
use adk_graph::error::GraphError;
use adk_graph::graph::StateGraph;
use adk_graph::node::NodeOutput;
use serde_json::json;

#[test]
fn test_basic_graph_construction() {
    let graph = StateGraph::with_channels(&["input", "output"])
        .add_node_fn("process", |_ctx| async move { Ok(NodeOutput::new()) })
        .add_edge(START, "process")
        .add_edge("process", END)
        .compile();

    assert!(graph.is_ok());
}

#[test]
fn test_graph_missing_entry() {
    let graph = StateGraph::with_channels(&["input"])
        .add_node_fn("process", |_ctx| async move { Ok(NodeOutput::new()) })
        .add_edge("process", END)
        .compile();

    assert!(matches!(graph, Err(GraphError::NoEntryPoint)));
}

#[test]
fn test_graph_missing_node() {
    let graph = StateGraph::with_channels(&["input"])
        .add_node_fn("process", |_ctx| async move { Ok(NodeOutput::new()) })
        .add_edge(START, "nonexistent")
        .compile();

    // Reference to nonexistent node should fail validation
    assert!(graph.is_err());
}

#[test]
fn test_graph_with_multiple_nodes() {
    let graph =
        StateGraph::with_channels(&["value"])
            .add_node_fn("step1", |_ctx| async move {
                Ok(NodeOutput::new().with_update("value", json!(1)))
            })
            .add_node_fn("step2", |_ctx| async move {
                Ok(NodeOutput::new().with_update("value", json!(2)))
            })
            .add_node_fn("step3", |_ctx| async move {
                Ok(NodeOutput::new().with_update("value", json!(3)))
            })
            .add_edge(START, "step1")
            .add_edge("step1", "step2")
            .add_edge("step2", "step3")
            .add_edge("step3", END)
            .compile();

    assert!(graph.is_ok());
}

#[test]
fn test_graph_with_conditional_edges() {
    let graph = StateGraph::with_channels(&["action", "result"])
        .add_node_fn("router", |_ctx| async move { Ok(NodeOutput::new()) })
        .add_node_fn("action_a", |_ctx| async move {
            Ok(NodeOutput::new().with_update("result", json!("A")))
        })
        .add_node_fn("action_b", |_ctx| async move {
            Ok(NodeOutput::new().with_update("result", json!("B")))
        })
        .add_edge(START, "router")
        .add_conditional_edges(
            "router",
            |state| state.get("action").and_then(|v| v.as_str()).unwrap_or("a").to_string(),
            [("a", "action_a"), ("b", "action_b")],
        )
        .add_edge("action_a", END)
        .add_edge("action_b", END)
        .compile();

    assert!(graph.is_ok());
}

#[test]
fn test_graph_with_cycle() {
    let graph = StateGraph::with_channels(&["count", "done"])
        .add_node_fn("increment", |ctx| async move {
            let count = ctx.get("count").and_then(|v| v.as_i64()).unwrap_or(0);
            Ok(NodeOutput::new()
                .with_update("count", json!(count + 1))
                .with_update("done", json!(count >= 2)))
        })
        .add_node_fn("finish", |_ctx| async move { Ok(NodeOutput::new()) })
        .add_edge(START, "increment")
        .add_conditional_edges(
            "increment",
            |state| {
                if state.get("done").and_then(|v| v.as_bool()).unwrap_or(false) {
                    "finish".to_string()
                } else {
                    "increment".to_string()
                }
            },
            [("increment", "increment"), ("finish", "finish")],
        )
        .add_edge("finish", END)
        .compile();

    assert!(graph.is_ok());
}

#[test]
fn test_graph_with_recursion_limit() {
    // Just verify it compiles and doesn't panic
    let _graph = StateGraph::with_channels(&["count"])
        .add_node_fn("loop", |_ctx| async move { Ok(NodeOutput::new()) })
        .add_edge(START, "loop")
        .add_edge("loop", END)
        .compile()
        .unwrap()
        .with_recursion_limit(5);
}

#[test]
fn test_state_graph_builder_methods() {
    let graph = StateGraph::with_channels(&["a", "b", "c"]);

    assert!(graph.schema.channels.contains_key("a"));
    assert!(graph.schema.channels.contains_key("b"));
    assert!(graph.schema.channels.contains_key("c"));
}

#[test]
fn test_graph_node_access() {
    let graph = StateGraph::with_channels(&["value"])
        .add_node_fn("node_a", |_ctx| async move { Ok(NodeOutput::new()) })
        .add_node_fn("node_b", |_ctx| async move { Ok(NodeOutput::new()) })
        .add_edge(START, "node_a")
        .add_edge("node_a", "node_b")
        .add_edge("node_b", END);

    assert!(graph.nodes.contains_key("node_a"));
    assert!(graph.nodes.contains_key("node_b"));
    assert_eq!(graph.nodes.len(), 2);
}