langgraph4rust 0.2.3

A powerful Rust implementation of a stateful workflow engine inspired by Python's LangGraph
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
//! `state_graph_stream` 模块的全场景测试。
//!
//! 通过公开 API `StateGraph::stream()` 验证推送式事件流的所有行为:
//! 事件顺序、步骤编号、并行计时、条件路由、错误路径、max_steps 截断、接收方提前丢弃等。

use langgraph4rust::{
    AgentNode, AgentState, DefaultMemoryState, END_NODE, LangGraphError, START_NODE,
    StateGraphBuilder, StreamEvent, StreamExt,
};
use serde::Serialize;
use std::collections::HashSet;
use std::sync::Arc;
use std::time::Duration;
// ─── 测试节点 ────────────────────────────────────────────────────────────────

/// 计数节点:每次执行将 state["count"] 加 1
#[derive(Debug, Clone)]
struct CounterNode;

#[langgraph4rust::async_trait]
impl AgentNode<DefaultMemoryState> for CounterNode {
    async fn apply(&self, state: Arc<DefaultMemoryState>) -> Result<(), LangGraphError> {
        let count: i32 = state.get("count").await?.unwrap_or(0);
        state.set("count", count + 1).await?;
        Ok(())
    }
}

/// 失败节点:总是返回错误
#[derive(Debug, Clone)]
struct FailingNode;

#[langgraph4rust::async_trait]
impl AgentNode<DefaultMemoryState> for FailingNode {
    async fn apply(&self, _state: Arc<DefaultMemoryState>) -> Result<(), LangGraphError> {
        Err(LangGraphError::NodeError("intentional failure".into()))
    }
}

/// 慢节点:休眠指定毫秒后写入 state
#[derive(Debug, Clone)]
struct SlowNode {
    ms: u64,
}

#[langgraph4rust::async_trait]
impl AgentNode<DefaultMemoryState> for SlowNode {
    async fn apply(&self, state: Arc<DefaultMemoryState>) -> Result<(), LangGraphError> {
        tokio::time::sleep(Duration::from_millis(self.ms)).await;
        state.set("slow_done", true).await?;
        Ok(())
    }
}

/// 路由节点:根据 state["route"] 决定下一跳(用于条件边)
#[derive(Debug, Clone)]
struct RouterNode;

#[langgraph4rust::async_trait]
impl AgentNode<DefaultMemoryState> for RouterNode {
    async fn apply(&self, state: Arc<DefaultMemoryState>) -> Result<(), LangGraphError> {
        // 仅作为路由锚点,不做实际工作
        let _ = state.get::<i32>("route").await?;
        Ok(())
    }
}

// ─── 辅助函数 ────────────────────────────────────────────────────────────────

/// 收集流中所有事件(泛型:支持任意 AgentState 实现)
async fn collect_events<S>(
    graph: Arc<langgraph4rust::StateGraph<S>>,
    state: Arc<S>,
) -> Vec<StreamEvent<S>>
where
    S: AgentState + Send + Sync + 'static,
{
    let mut rx = graph.stream(state);
    let mut events = Vec::new();
    while let Some(event) = rx.next().await {
        events.push(event);
    }
    events
}

/// 从事件流末尾提取 WorkflowError 携带的错误(测试辅助)
fn extract_error(events: &[StreamEvent<DefaultMemoryState>]) -> &LangGraphError {
    match events.last() {
        Some(StreamEvent::WorkflowError { error, .. }) => error,
        _ => panic!("expected WorkflowError as last event"),
    }
}

// ─── 1. 线性工作流:事件完整序列 ─────────────────────────────────────────────

/// start → A → end
/// 预期事件序列:WorkflowStarted, StepStarted, NodeStarted, NodeFinished,
///              RoutingDecision, WorkflowFinished
#[tokio::test]
async fn test_linear_event_sequence() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(graph, state.clone()).await;

    // 首尾事件
    assert!(matches!(events.first(), Some(StreamEvent::WorkflowStarted)));
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));

    // __start__ 虚拟节点占 step 1(仅 RoutingDecision),真实节点从 step 2 开始
    // 事件序列:WorkflowStarted, RoutingDecision(start→a), StepStarted(a),
    //          NodeStarted(a), NodeFinished(a), RoutingDecision(a→end), WorkflowFinished
    assert_eq!(events.len(), 7, "expected 7 events, got {}", events.len());
    assert!(matches!(
        &events[1],
        StreamEvent::RoutingDecision { step: 1, .. }
    ));
    assert!(matches!(&events[2], StreamEvent::StepStarted { step: 2, nodes } if nodes == &["a"]));
    assert!(matches!(&events[3], StreamEvent::NodeStarted { step: 2, name } if name == "a"));
    assert!(matches!(&events[4], StreamEvent::NodeFinished { step: 2, name, .. } if name == "a"));
    assert!(matches!(
        &events[5],
        StreamEvent::RoutingDecision { step: 2, .. }
    ));

    // 状态被更新
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, 1);
    Ok(())
}

// ─── 2. 步骤编号一致性 ──────────────────────────────────────────────────────

/// start → A → B → end(两步)
/// 验证 StepStarted / NodeStarted / NodeFinished / RoutingDecision 的 step 字段同步递增
#[tokio::test]
async fn test_step_index_consistency() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // __start__ 占 step 1(仅 RoutingDecision),真实节点 A 在 step 2,B 在 step 3
    let mut step1_events = 0usize;
    let mut step2_events = 0usize;
    let mut step3_events = 0usize;
    for e in &events {
        match e {
            StreamEvent::StepStarted { step, .. }
            | StreamEvent::NodeStarted { step, .. }
            | StreamEvent::NodeFinished { step, .. }
            | StreamEvent::RoutingDecision { step, .. } => match *step {
                1 => step1_events += 1,
                2 => step2_events += 1,
                3 => step3_events += 1,
                _ => panic!("unexpected step index: {}", step),
            },
            _ => {}
        }
    }
    // step1: 仅 RoutingDecision(__start__→a) = 1
    assert_eq!(
        step1_events, 1,
        "step 1 should have 1 event (RoutingDecision)"
    );
    // step2: StepStarted + NodeStarted + NodeFinished + RoutingDecision = 4
    assert_eq!(step2_events, 4, "step 2 should have 4 events");
    // step3: 同上 = 4
    assert_eq!(step3_events, 4, "step 3 should have 4 events");
    Ok(())
}

// ─── 3. WorkflowFinished 元数据 ─────────────────────────────────────────────

#[tokio::test]
async fn test_workflow_finished_metadata() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_node("c", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from(["c".to_string()]));
    builder.add_edge("c", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    if let Some(StreamEvent::WorkflowFinished {
        state: final_state,
        total_steps,
        elapsed,
    }) = events.last()
    {
        // total_steps 包含 __start__ 步和 __end__ 检测步
        assert_eq!(
            *total_steps, 5,
            "should execute 5 steps (start + 3 nodes + end)"
        );
        assert!(*elapsed > Duration::ZERO, "elapsed should be positive");
        // final_state 与传入的 state 是同一个 Arc
        let count: i32 = final_state.get("count").await?.unwrap_or(0);
        assert_eq!(count, 3);
    } else {
        panic!("last event should be WorkflowFinished");
    }
    Ok(())
}

// ─── 4. 并行节点:事件交错 & 独立计时 ───────────────────────────────────────

/// start → {slow_a, slow_b} → end
/// 两节点各休眠 50ms,并行执行时总耗时应 < 100ms(串行则 >= 100ms)
#[tokio::test]
async fn test_parallel_nodes_concurrent_timing() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("slow_a", Box::new(SlowNode { ms: 50 }));
    builder.add_node("slow_b", Box::new(SlowNode { ms: 50 }));
    builder.add_edge(
        START_NODE,
        HashSet::from(["slow_a".to_string(), "slow_b".to_string()]),
    );
    builder.add_edge("slow_a", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("slow_b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // 收集两个节点的 elapsed
    let elapsed_values: Vec<Duration> = events
        .iter()
        .filter_map(|e| match e {
            StreamEvent::NodeFinished { elapsed, .. } => Some(*elapsed),
            _ => None,
        })
        .collect();
    assert_eq!(elapsed_values.len(), 2, "should have 2 NodeFinished events");

    // 每个节点的 elapsed 应 >= 50ms(自身真实耗时)
    for d in &elapsed_values {
        assert!(
            *d >= Duration::from_millis(45),
            "node elapsed {:?} should be ~50ms",
            d
        );
    }

    // WorkflowFinished.elapsed 应 < 150ms(并行,非串行 100ms+)
    if let Some(StreamEvent::WorkflowFinished { elapsed, .. }) = events.last() {
        assert!(
            *elapsed < Duration::from_millis(150),
            "total elapsed {:?} suggests sequential execution",
            elapsed
        );
    }
    Ok(())
}

/// 验证并行步骤的 StepStarted.nodes 包含所有并行节点名
#[tokio::test]
async fn test_parallel_step_started_contains_all_nodes() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("x", Box::new(CounterNode));
    builder.add_node("y", Box::new(CounterNode));
    builder.add_node("z", Box::new(CounterNode));
    builder.add_edge(
        START_NODE,
        HashSet::from(["x".to_string(), "y".to_string(), "z".to_string()]),
    );
    builder.add_edge("x", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("y", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("z", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    let step_started = events
        .iter()
        .find(|e| matches!(e, StreamEvent::StepStarted { .. }));
    if let Some(StreamEvent::StepStarted { step, nodes }) = step_started {
        assert_eq!(*step, 2, "real nodes start at step 2");
        assert_eq!(nodes.len(), 3);
        let set: HashSet<&String> = nodes.iter().collect();
        assert!(set.contains(&&"x".to_string()));
        assert!(set.contains(&&"y".to_string()));
        assert!(set.contains(&&"z".to_string()));
    } else {
        panic!("should have StepStarted event");
    }
    Ok(())
}

// ─── 5. 条件路由 ────────────────────────────────────────────────────────────

/// start → router → (条件边根据 state["route"] 选 "left" 或 "right") → end
#[tokio::test]
async fn test_conditional_routing_decision() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("router", Box::new(RouterNode));
    builder.add_node("left", Box::new(CounterNode));
    builder.add_node("right", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["router".to_string()]));
    builder.add_conditional_edge(
        "router",
        vec![Box::new(|state: &DefaultMemoryState| {
            // 同步上下文中无法 await,用 blocking 方式读取(测试简化)
            // 这里直接返回固定值模拟路由
            let _ = state;
            "left".to_string()
        })],
    );
    builder.add_edge("left", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("right", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // 应存在 RoutingDecision 且 to_nodes 包含 "left"(从 router 出发的条件路由)
    let routing = events.iter().find(|e| matches!(
        e,
        StreamEvent::RoutingDecision { from_nodes, .. } if from_nodes.contains(&"router".to_string())
    ));
    assert!(routing.is_some(), "should have RoutingDecision from router");
    if let Some(StreamEvent::RoutingDecision {
        from_nodes,
        to_nodes,
        ..
    }) = routing
    {
        assert!(from_nodes.contains(&"router".to_string()));
        assert!(to_nodes.contains(&"left".to_string()));
    }

    // 最终成功
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    Ok(())
}

// ─── 6. 节点执行失败 → WorkflowError ────────────────────────────────────────

#[tokio::test]
async fn test_node_failure_emits_workflow_error() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("ok", Box::new(CounterNode));
    builder.add_node("fail", Box::new(FailingNode));
    builder.add_edge(START_NODE, HashSet::from(["ok".to_string()]));
    builder.add_edge("ok", HashSet::from(["fail".to_string()]));
    builder.add_edge("fail", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // 首事件 WorkflowStarted
    assert!(matches!(events.first(), Some(StreamEvent::WorkflowStarted)));
    // 末事件 WorkflowError(不是 WorkflowFinished)
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowError { .. })
    ));
    // 不应出现 WorkflowFinished
    assert!(
        !events
            .iter()
            .any(|e| matches!(e, StreamEvent::WorkflowFinished { .. }))
    );

    // 错误内容验证(__start__=step1, ok=step2, fail=step3)
    if let Some(StreamEvent::WorkflowError { step, error, .. }) = events.last() {
        assert_eq!(*step, 3, "error should occur at step 3");
        assert!(matches!(error, LangGraphError::NodeError(_)));
    }
    Ok(())
}

/// 并行节点中一个失败 → WorkflowError,且 NodeFinished 仍被发射(失败节点也有)
#[tokio::test]
async fn test_parallel_node_failure() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("good", Box::new(CounterNode));
    builder.add_node("bad", Box::new(FailingNode));
    builder.add_edge(
        START_NODE,
        HashSet::from(["good".to_string(), "bad".to_string()]),
    );
    builder.add_edge("good", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("bad", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // 应以 WorkflowError 结束
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowError { .. })
    ));
    // 两个节点都应有 NodeStarted(并行启动)
    let started_count = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::NodeStarted { .. }))
        .count();
    assert_eq!(started_count, 2, "both nodes should start");
    Ok(())
}

// ─── 7. max_steps 耗尽 → WorkflowError ──────────────────────────────────────

/// 构造一个环:A → B → A → B → ...,设 max_steps=4,永远到不了 end
#[tokio::test]
async fn test_max_steps_exhaustion_emits_error() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.set_max_steps(4);
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from(["a".to_string()])); // 环!永远不到 end
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    // 末事件应为 WorkflowError(GraphError: Reached max_steps)
    if let Some(StreamEvent::WorkflowError { step, error, .. }) = events.last() {
        assert_eq!(*step, 4, "should stop at max_steps");
        let msg = error.to_string();
        assert!(
            msg.contains("max_steps"),
            "error should mention max_steps, got: {}",
            msg
        );
    } else {
        panic!("last event should be WorkflowError");
    }

    // 不应出现 WorkflowFinished
    assert!(
        !events
            .iter()
            .any(|e| matches!(e, StreamEvent::WorkflowFinished { .. }))
    );

    // 状态仍被部分更新(执行了若干步)
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert!(count > 0, "some steps should have executed");
    Ok(())
}

// ─── 8. 接收方提前 drop → 驱动静默终止 ──────────────────────────────────────

#[tokio::test]
async fn test_receiver_drop_terminates_driver() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    for name in ["n1", "n2", "n3", "n4", "n5"] {
        builder.add_node(name, Box::new(SlowNode { ms: 20 }));
    }
    builder.add_edge(START_NODE, HashSet::from(["n1".to_string()]));
    builder.add_edge("n1", HashSet::from(["n2".to_string()]));
    builder.add_edge("n2", HashSet::from(["n3".to_string()]));
    builder.add_edge("n3", HashSet::from(["n4".to_string()]));
    builder.add_edge("n4", HashSet::from(["n5".to_string()]));
    builder.add_edge("n5", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let mut rx = graph.stream(Arc::new(DefaultMemoryState::new()));

    // 只取第一个事件后立即 drop
    let first = rx.next().await;
    assert!(matches!(first, Some(StreamEvent::WorkflowStarted)));
    drop(rx);

    // 给后台任务一点时间感知 drop 并退出(不会 panic)
    tokio::time::sleep(Duration::from_millis(50)).await;
    // 到这里没有 panic 即为通过
    Ok(())
}

// ─── 9. 多步状态累积 ────────────────────────────────────────────────────────

#[tokio::test]
async fn test_state_accumulates_across_steps() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    for name in ["s1", "s2", "s3", "s4"] {
        builder.add_node(name, Box::new(CounterNode));
    }
    builder.add_edge(START_NODE, HashSet::from(["s1".to_string()]));
    builder.add_edge("s1", HashSet::from(["s2".to_string()]));
    builder.add_edge("s2", HashSet::from(["s3".to_string()]));
    builder.add_edge("s3", HashSet::from(["s4".to_string()]));
    builder.add_edge("s4", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, 4, "4 nodes should increment count 4 times");
    Ok(())
}

// ─── 10. NodeFinished.elapsed 精确性 ────────────────────────────────────────

/// 单慢节点(80ms),验证 NodeFinished.elapsed >= 80ms
#[tokio::test]
async fn test_node_finished_elapsed_accuracy() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("slow", Box::new(SlowNode { ms: 80 }));
    builder.add_edge(START_NODE, HashSet::from(["slow".to_string()]));
    builder.add_edge("slow", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    let node_finished = events
        .iter()
        .find(|e| matches!(e, StreamEvent::NodeFinished { name, .. } if name == "slow"));
    if let Some(StreamEvent::NodeFinished { elapsed, .. }) = node_finished {
        assert!(
            *elapsed >= Duration::from_millis(75),
            "elapsed {:?} should be >= ~80ms",
            elapsed
        );
    } else {
        panic!("should have NodeFinished for 'slow'");
    }
    Ok(())
}

// ─── 11. RoutingDecision 内容正确性 ─────────────────────────────────────────

#[tokio::test]
async fn test_routing_decision_from_to_nodes() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("alpha", Box::new(CounterNode));
    builder.add_node("beta", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["alpha".to_string()]));
    builder.add_edge("alpha", HashSet::from(["beta".to_string()]));
    builder.add_edge("beta", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // 共 3 条路由:__start__→alpha, alpha→beta, beta→__end__
    let routings: Vec<_> = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::RoutingDecision { .. }))
        .collect();
    assert_eq!(routings.len(), 3, "should have 3 routing decisions");

    // 第一条:__start__ → alpha (step 1)
    if let StreamEvent::RoutingDecision {
        step,
        from_nodes,
        to_nodes,
    } = routings[0]
    {
        assert_eq!(*step, 1);
        assert!(from_nodes.contains(&"__start__".to_string()));
        assert!(to_nodes.contains(&"alpha".to_string()));
    }
    // 第二条:alpha → beta (step 2)
    if let StreamEvent::RoutingDecision {
        step,
        from_nodes,
        to_nodes,
    } = routings[1]
    {
        assert_eq!(*step, 2);
        assert!(from_nodes.contains(&"alpha".to_string()));
        assert!(to_nodes.contains(&"beta".to_string()));
    }
    // 第三条:beta → __end__ (step 3)
    if let StreamEvent::RoutingDecision {
        step,
        from_nodes,
        to_nodes,
    } = routings[2]
    {
        assert_eq!(*step, 3);
        assert!(from_nodes.contains(&"beta".to_string()));
        assert!(to_nodes.contains(&"__end__".to_string()));
    }
    Ok(())
}

// ─── 12. 事件总数精确验证 ───────────────────────────────────────────────────

/// N 步线性图的事件总数 = 1(WorkflowStarted) + 1(__start__ RoutingDecision) + N*(StepStarted+NodeStarted+NodeFinished+RoutingDecision) + 1(WorkflowFinished)
/// 即 3 + 4N
#[tokio::test]
async fn test_event_count_formula() -> Result<(), LangGraphError> {
    // N 个真实节点:step1=__start__(仅RoutingDecision), step2..N+1=真实节点(各4事件), stepN+2=__end__检测
    // 事件总数 = 1(WorkflowStarted) + 1(__start__ RoutingDecision) + N*4 + 1(WorkflowFinished) = 3 + 4N
    for n in 1..=6 {
        let mut builder = StateGraphBuilder::new();
        let names: Vec<String> = (0..n).map(|i| format!("node_{}", i)).collect();
        for name in &names {
            builder.add_node(name, Box::new(CounterNode));
        }
        builder.add_edge(START_NODE, HashSet::from([names[0].clone()]));
        for i in 0..n - 1 {
            builder.add_edge(&names[i], HashSet::from([names[i + 1].clone()]));
        }
        builder.add_edge(&names[n - 1], HashSet::from([END_NODE.to_string()]));
        let graph = Arc::new(builder.compile()?);

        let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
        let expected = 3 + 4 * n;
        assert_eq!(
            events.len(),
            expected,
            "n={}: expected {} events, got {}",
            n,
            expected,
            events.len()
        );
    }
    Ok(())
}

// ─── 13. WorkflowStarted 始终是第一个事件 ────────────────────────────────────

#[tokio::test]
async fn test_workflow_started_always_first() -> Result<(), LangGraphError> {
    // 成功路径
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);
    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    assert!(matches!(events[0], StreamEvent::WorkflowStarted));

    // 失败路径
    let mut builder = StateGraphBuilder::new();
    builder.add_node("f", Box::new(FailingNode));
    builder.add_edge(START_NODE, HashSet::from(["f".to_string()]));
    builder.add_edge("f", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);
    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    assert!(matches!(events[0], StreamEvent::WorkflowStarted));
    Ok(())
}

// ─── 14. WorkflowError 是失败时的最后一个事件(流随即关闭)────────────────────

#[tokio::test]
async fn test_workflow_error_is_terminal() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("fail", Box::new(FailingNode));
    builder.add_node("unreachable", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["fail".to_string()]));
    builder.add_edge("fail", HashSet::from(["unreachable".to_string()]));
    builder.add_edge("unreachable", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // WorkflowError 是最后一个事件
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowError { .. })
    ));
    // "unreachable" 节点不应有任何事件
    assert!(!events.iter().any(|e| matches!(
        e,
        StreamEvent::NodeStarted { name, .. } if name == "unreachable"
    )));
    Ok(())
}

// ─── 15. 菱形拓扑:fan-out 后 fan-in ────────────────────────────────────────

/// start → {a, b} → merge → end:并行分支汇聚到单一节点
#[tokio::test]
async fn test_diamond_fan_out_fan_in() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_node("merge", Box::new(CounterNode));
    builder.add_edge(
        START_NODE,
        HashSet::from(["a".to_string(), "b".to_string()]),
    );
    builder.add_edge("a", HashSet::from(["merge".to_string()]));
    builder.add_edge("b", HashSet::from(["merge".to_string()]));
    builder.add_edge("merge", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    // a, b, merge 各执行一次
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, 3, "a + b + merge should run 3 times");
    // merge 只应启动一次(fan-in 去重)
    let merge_starts = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::NodeStarted { name, .. } if name == "merge"))
        .count();
    assert_eq!(merge_starts, 1, "merge should run exactly once");
    Ok(())
}

// ─── 16. 并行节点全部成功 ────────────────────────────────────────────────────

#[tokio::test]
async fn test_parallel_all_nodes_finish_successfully() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_node("c", Box::new(CounterNode));
    builder.add_edge(
        START_NODE,
        HashSet::from(["a".to_string(), "b".to_string(), "c".to_string()]),
    );
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("c", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    let finished = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::NodeFinished { .. }))
        .count();
    assert_eq!(finished, 3, "all 3 nodes should finish");
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, 3);
    Ok(())
}

// ─── 17. WorkflowError 携带状态快照(部分更新保留)─────────────────────

#[tokio::test]
async fn test_workflow_error_carries_state_snapshot() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("ok", Box::new(CounterNode));
    builder.add_node("fail", Box::new(FailingNode));
    builder.add_edge(START_NODE, HashSet::from(["ok".to_string()]));
    builder.add_edge("ok", HashSet::from(["fail".to_string()]));
    builder.add_edge("fail", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    if let Some(StreamEvent::WorkflowError { state, .. }) = events.last() {
        // ok 节点已将 count 置 1,错误快照应保留该部分更新
        let count: i32 = state.get("count").await?.unwrap_or(0);
        assert_eq!(count, 1, "error snapshot should keep partial update");
    } else {
        panic!("last event should be WorkflowError");
    }
    Ok(())
}

// ─── 18. WorkflowFinished.state 与输入是同一个 Arc ─────────────────────────

#[tokio::test]
async fn test_workflow_finished_state_is_same_arc() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(graph, Arc::clone(&state)).await;

    if let Some(StreamEvent::WorkflowFinished {
        state: final_state, ..
    }) = events.last()
    {
        assert!(
            Arc::ptr_eq(&state, final_state),
            "finished state should be the same Arc as input"
        );
    } else {
        panic!("last event should be WorkflowFinished");
    }
    Ok(())
}

// ─── 19. 图复用:同一编译图顺序多次 stream ────────────────────────────────

#[tokio::test]
async fn test_graph_reuse_sequential_streams() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    // 两次独立执行,状态互不干扰
    for _ in 0..2 {
        let state = Arc::new(DefaultMemoryState::new());
        let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;
        assert!(matches!(
            events.last(),
            Some(StreamEvent::WorkflowFinished { .. })
        ));
        let count: i32 = state.get("count").await?.unwrap_or(0);
        assert_eq!(count, 1, "each run starts from fresh state");
    }
    Ok(())
}

// ─── 20. 并发流:同一 Arc 图同时跑多个 stream ──────────────────────────────

#[tokio::test]
async fn test_concurrent_streams_same_graph() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let (e1, e2, e3) = tokio::join!(
        collect_events(Arc::clone(&graph), Arc::new(DefaultMemoryState::new())),
        collect_events(Arc::clone(&graph), Arc::new(DefaultMemoryState::new())),
        collect_events(Arc::clone(&graph), Arc::new(DefaultMemoryState::new())),
    );
    for events in [&e1, &e2, &e3] {
        assert!(matches!(
            events.last(),
            Some(StreamEvent::WorkflowFinished { .. })
        ));
    }
    Ok(())
}

// ─── 21. 多 router 条件边:下一跳为各 router 结果并集 ─────────────────────

/// 单一条件边含两个 router(分别返回 t1 / t2),下一步应同时执行 t1 和 t2
#[tokio::test]
async fn test_multiple_conditional_routers_merge() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("split", Box::new(CounterNode));
    builder.add_node("t1", Box::new(CounterNode));
    builder.add_node("t2", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["split".to_string()]));
    builder.add_conditional_edge(
        "split",
        vec![
            Box::new(|_state: &DefaultMemoryState| "t1".to_string()),
            Box::new(|_state: &DefaultMemoryState| "t2".to_string()),
        ],
    );
    builder.add_edge("t1", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("t2", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    // 从 split 出发的 RoutingDecision 应同时包含 t1 和 t2
    let routing = events.iter().find(|e| matches!(
        e,
        StreamEvent::RoutingDecision { from_nodes, .. } if from_nodes.contains(&"split".to_string())
    ));
    if let Some(StreamEvent::RoutingDecision { to_nodes, .. }) = routing {
        assert!(to_nodes.contains(&"t1".to_string()), "missing t1");
        assert!(to_nodes.contains(&"t2".to_string()), "missing t2");
    } else {
        panic!("should have RoutingDecision from split");
    }
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    // t1, t2 各执行一次(split 也执行)→ count = 3
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, 3);
    Ok(())
}

/// 补充:验证器禁止同一节点同时拥有静态边与条件边(compile 报错)
#[test]
fn test_node_cannot_have_both_static_and_conditional_edges() {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("split", Box::new(CounterNode));
    builder.add_node("t", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["split".to_string()]));
    builder.add_edge("split", HashSet::from(["t".to_string()]));
    builder.add_conditional_edge(
        "split",
        vec![Box::new(|_state: &DefaultMemoryState| "t".to_string())],
    );
    builder.add_edge("t", HashSet::from([END_NODE.to_string()]));

    let result = builder.compile();
    assert!(
        result.is_err(),
        "compile should reject mixed static + conditional edges"
    );
    let err = result.err().unwrap();
    assert!(matches!(err, LangGraphError::GraphError(_)));
    assert!(
        err.to_string()
            .contains("both static edges and conditional edges")
    );
}

// ─── 22. 条件边直接路由到 END ───────────────────────────────────────────────

#[tokio::test]
async fn test_conditional_edge_directly_to_end() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("router", Box::new(RouterNode));
    builder.add_edge(START_NODE, HashSet::from(["router".to_string()]));
    builder.add_conditional_edge(
        "router",
        vec![Box::new(|_state: &DefaultMemoryState| END_NODE.to_string())],
    );
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    // router 后直接结束,不应有其他节点启动
    let started = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::NodeStarted { .. }))
        .count();
    assert_eq!(started, 1, "only router should start");
    Ok(())
}

// ─── 23. 大扇出:触发有界通道背压 ───────────────────────────────────────────

/// 20 个并行节点,单步事件数(StepStarted+20*Started+20*Finished+Routing=42)超过通道容量32,
/// 验证背压下不死锁、全部完成
#[tokio::test]
async fn test_large_fan_out_backpressure() -> Result<(), LangGraphError> {
    const N: usize = 20;
    let mut builder = StateGraphBuilder::new();
    let names: Vec<String> = (0..N).map(|i| format!("p{}", i)).collect();
    for name in &names {
        builder.add_node(name, Box::new(CounterNode));
    }
    builder.add_edge(START_NODE, names.iter().cloned().collect());
    for name in &names {
        builder.add_edge(name, HashSet::from([END_NODE.to_string()]));
    }
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    let finished = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::NodeFinished { .. }))
        .count();
    assert_eq!(finished, N, "all {} nodes should finish", N);
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, N as i32);
    Ok(())
}

// ─── 24. 自循环 + max_steps ─────────────────────────────────────────────────

/// a → a(自环),永远到不了 end,max_steps=3 截断
#[tokio::test]
async fn test_self_loop_max_steps() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.set_max_steps(3);
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["a".to_string()])); // 自环
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    if let Some(StreamEvent::WorkflowError { error, .. }) = events.last() {
        assert!(
            error.to_string().contains("max_steps"),
            "should report max_steps"
        );
    } else {
        panic!("last event should be WorkflowError");
    }
    assert!(
        !events
            .iter()
            .any(|e| matches!(e, StreamEvent::WorkflowFinished { .. }))
    );
    Ok(())
}

// ─── 25. 失败节点仍发射 NodeFinished ────────────────────────────────────────

/// run_node_with_events 在 apply 返回后无条件发 NodeFinished,故失败节点也有该事件
#[tokio::test]
async fn test_failing_node_still_emits_node_finished() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("fail", Box::new(FailingNode));
    builder.add_edge(START_NODE, HashSet::from(["fail".to_string()]));
    builder.add_edge("fail", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    assert!(events.iter().any(|e| matches!(
        e,
        StreamEvent::NodeStarted { name, .. } if name == "fail"
    )));
    assert!(
        events.iter().any(|e| matches!(
            e,
            StreamEvent::NodeFinished { name, .. } if name == "fail"
        )),
        "failing node should still emit NodeFinished"
    );
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowError { .. })
    ));
    Ok(())
}

// ─── 26. 状态依赖的条件路由(自定义同步可读状态)─────────────────────

/// 同步可读的状态实现:router 是同步 Fn,需能同步读取节点异步写入的路由值
#[derive(Clone)]
struct SyncRouteState {
    data: Arc<std::sync::Mutex<std::collections::HashMap<String, serde_json::Value>>>,
}

impl SyncRouteState {
    fn new() -> Self {
        Self {
            data: Arc::new(std::sync::Mutex::new(std::collections::HashMap::new())),
        }
    }
    /// 同步读取字符串值(供同步 router 使用)
    fn get_sync(&self, key: &str) -> Option<String> {
        self.data
            .lock()
            .unwrap()
            .get(key)
            .and_then(|v| v.as_str().map(|s| s.to_string()))
    }
}

#[langgraph4rust::async_trait]
impl AgentState for SyncRouteState {
    async fn get<T: serde::de::DeserializeOwned + Send + Sync>(
        &self,
        key: &str,
    ) -> Result<Option<T>, LangGraphError> {
        let guard = self.data.lock().unwrap();
        Ok(guard
            .get(key)
            .and_then(|v| serde_json::from_value(v.clone()).ok()))
    }
    async fn set<T: serde::Serialize + Send + Sync>(
        &self,
        key: &str,
        value: T,
    ) -> Result<bool, LangGraphError> {
        let v =
            serde_json::to_value(value).map_err(|e| LangGraphError::StateError(e.to_string()))?;
        self.data.lock().unwrap().insert(key.to_string(), v);
        Ok(true)
    }

    async fn snapshot(&self, step: usize, node_keys: Vec<String>) -> Result<(), ()> {
        Ok(())
    }
}

/// 写入路由值的节点
#[derive(Clone)]
struct SetRouteNode {
    target: String,
}

#[langgraph4rust::async_trait]
impl AgentNode<SyncRouteState> for SetRouteNode {
    async fn apply(&self, state: Arc<SyncRouteState>) -> Result<(), LangGraphError> {
        state.set("route", self.target.clone()).await?;
        Ok(())
    }
}

/// 打标记节点:访问时在 state 写入 key=true
#[derive(Clone)]
struct MarkNode {
    key: String,
}

#[langgraph4rust::async_trait]
impl AgentNode<SyncRouteState> for MarkNode {
    async fn apply(&self, state: Arc<SyncRouteState>) -> Result<(), LangGraphError> {
        state.set(&self.key, true).await?;
        Ok(())
    }
}

/// decide 节点将 route 置为 "right",条件边同步读取后路由到 right 分支
#[tokio::test]
async fn test_state_dependent_conditional_routing() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::<SyncRouteState>::new();
    builder.add_node(
        "decide",
        Box::new(SetRouteNode {
            target: "right".to_string(),
        }),
    );
    builder.add_node(
        "left",
        Box::new(MarkNode {
            key: "left_visited".to_string(),
        }),
    );
    builder.add_node(
        "right",
        Box::new(MarkNode {
            key: "right_visited".to_string(),
        }),
    );
    builder.add_edge(START_NODE, HashSet::from(["decide".to_string()]));
    builder.add_conditional_edge(
        "decide",
        vec![Box::new(|state: &SyncRouteState| {
            state
                .get_sync("route")
                .unwrap_or_else(|| "left".to_string())
        })],
    );
    builder.add_edge("left", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("right", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(SyncRouteState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    let right: Option<bool> = state.get("right_visited").await?;
    let left: Option<bool> = state.get("left_visited").await?;
    assert_eq!(right, Some(true), "right branch should be visited");
    assert_eq!(left, None, "left branch should NOT be visited");
    Ok(())
}

// ─── 补充辅助节点 ─────────────────────────────────────────────────────────────

/// 写入固定整数的节点
#[derive(Debug, Clone)]
struct SetIntNode {
    key: String,
    value: i32,
}

#[langgraph4rust::async_trait]
impl AgentNode<DefaultMemoryState> for SetIntNode {
    async fn apply(&self, state: Arc<DefaultMemoryState>) -> Result<(), LangGraphError> {
        state.set(&self.key, self.value).await?;
        Ok(())
    }
}

/// 读取 read_key 并将其两倍写入 write_key 的节点(验证跨步数据依赖)
#[derive(Debug, Clone)]
struct DoubleNode {
    read_key: String,
    write_key: String,
}

#[langgraph4rust::async_trait]
impl AgentNode<DefaultMemoryState> for DoubleNode {
    async fn apply(&self, state: Arc<DefaultMemoryState>) -> Result<(), LangGraphError> {
        let v: i32 = state.get(&self.read_key).await?.unwrap_or(0);
        state.set(&self.write_key, v * 2).await?;
        Ok(())
    }
}

// ─── 27. 事件不变量:NodeStarted 与 NodeFinished 严格配对 ───────────────────

#[tokio::test]
async fn test_node_started_finished_pairing() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // (step, name) 集合:NodeStarted 与 NodeFinished 应完全一致
    let started: HashSet<(usize, String)> = events
        .iter()
        .filter_map(|e| match e {
            StreamEvent::NodeStarted { step, name } => Some((*step, name.clone())),
            _ => None,
        })
        .collect();
    let finished: HashSet<(usize, String)> = events
        .iter()
        .filter_map(|e| match e {
            StreamEvent::NodeFinished { step, name, .. } => Some((*step, name.clone())),
            _ => None,
        })
        .collect();
    assert_eq!(
        started, finished,
        "every NodeStarted must pair with a NodeFinished"
    );
    assert_eq!(started.len(), 2, "two real nodes should run");
    Ok(())
}

// ─── 28. 顺序不变量:NodeStarted 总在其 NodeFinished 之前 ───────────────────

#[tokio::test]
async fn test_node_started_precedes_its_finished() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("slow", Box::new(SlowNode { ms: 20 }));
    builder.add_edge(START_NODE, HashSet::from(["slow".to_string()]));
    builder.add_edge("slow", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    let started_pos = events
        .iter()
        .position(|e| matches!(e, StreamEvent::NodeStarted { name, .. } if name == "slow"));
    let finished_pos = events
        .iter()
        .position(|e| matches!(e, StreamEvent::NodeFinished { name, .. } if name == "slow"));
    match (started_pos, finished_pos) {
        (Some(s), Some(f)) => assert!(s < f, "NodeStarted must come before NodeFinished"),
        _ => panic!("both NodeStarted and NodeFinished should exist"),
    }
    Ok(())
}

// ─── 29. 顺序不变量:StepStarted 在同步 NodeStarted 之前 ────────────────────

#[tokio::test]
async fn test_step_started_precedes_node_started() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // 真实节点在 step 2:StepStarted{2} 应出现在 NodeStarted{2} 之前
    let step_pos = events
        .iter()
        .position(|e| matches!(e, StreamEvent::StepStarted { step: 2, .. }));
    let node_pos = events
        .iter()
        .position(|e| matches!(e, StreamEvent::NodeStarted { step: 2, .. }));
    match (step_pos, node_pos) {
        (Some(sp), Some(np)) => assert!(sp < np, "StepStarted must precede NodeStarted"),
        _ => panic!("both StepStarted and NodeStarted for step 2 should exist"),
    }
    Ok(())
}

// ─── 30. __start__ 虚拟步不产生 StepStarted ─────────────────────────────────

#[tokio::test]
async fn test_no_step_started_for_start_step() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // step 1 是 __start__ 虚拟步,只有 RoutingDecision,绝不应有 StepStarted
    assert!(
        !events
            .iter()
            .any(|e| matches!(e, StreamEvent::StepStarted { step: 1, .. })),
        "__start__ step (1) must not emit StepStarted"
    );
    Ok(())
}

// ─── 31. max_steps 精确边界:刚好足够→成功,差一步→失败 ───────────────────

/// start→a→end 需 total_steps=3(start路由 + a执行 + end检测)
#[tokio::test]
async fn test_max_steps_exact_boundary() -> Result<(), LangGraphError> {
    // max_steps = 3:刚好足够 → WorkflowFinished
    let mut builder = StateGraphBuilder::new();
    builder.set_max_steps(3);
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);
    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    match events.last() {
        Some(StreamEvent::WorkflowFinished { total_steps, .. }) => {
            assert_eq!(*total_steps, 3, "should finish exactly at max_steps");
        }
        other => panic!(
            "expected WorkflowFinished, got {:?}",
            std::mem::discriminant(other.unwrap())
        ),
    }

    // max_steps = 2:差一步 → WorkflowError(max_steps)
    let mut builder = StateGraphBuilder::new();
    builder.set_max_steps(2);
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);
    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    assert!(
        matches!(events.last(), Some(StreamEvent::WorkflowError { .. })),
        "one step short of max_steps should error"
    );
    Ok(())
}

// ─── 32. 条件路由返回未注册节点 → 运行时 NotFound 错误 ─────────────────────

/// 验证器只检查条件边源头,router 返回值的合法性在运行时才暴露
#[tokio::test]
async fn test_conditional_router_unknown_target_errors() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("router", Box::new(RouterNode));
    builder.add_edge(START_NODE, HashSet::from(["router".to_string()]));
    builder.add_conditional_edge(
        "router",
        vec![Box::new(|_state: &DefaultMemoryState| "ghost".to_string())],
    );
    // 能编译通过(ghost 未被静态检查)
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    match events.last() {
        Some(StreamEvent::WorkflowError { error, .. }) => {
            assert!(
                matches!(error, LangGraphError::GraphError(_)),
                "unknown router target should yield GraphError"
            );
        }
        _ => panic!("expected WorkflowError for unknown router target"),
    }
    Ok(())
}

// ─── 33. 跨步数据依赖:后续节点可读前置节点写入的值 ───────────────────────

#[tokio::test]
async fn test_data_dependency_across_steps() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node(
        "init",
        Box::new(SetIntNode {
            key: "n".to_string(),
            value: 5,
        }),
    );
    builder.add_node(
        "double",
        Box::new(DoubleNode {
            read_key: "n".to_string(),
            write_key: "n2".to_string(),
        }),
    );
    builder.add_edge(START_NODE, HashSet::from(["init".to_string()]));
    builder.add_edge("init", HashSet::from(["double".to_string()]));
    builder.add_edge("double", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    // double 读到 init 写入的 5,写出 10
    let n2: i32 = state.get("n2").await?.unwrap_or(0);
    assert_eq!(n2, 10, "downstream node should see upstream write");
    Ok(())
}

// ─── 34. WorkflowFinished.elapsed 不小于最慢节点耗时 ────────────────────────

#[tokio::test]
async fn test_workflow_finished_elapsed_lower_bound() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("fast", Box::new(SlowNode { ms: 30 }));
    builder.add_node("slow", Box::new(SlowNode { ms: 60 }));
    builder.add_edge(
        START_NODE,
        HashSet::from(["fast".to_string(), "slow".to_string()]),
    );
    builder.add_edge("fast", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("slow", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    let max_node_elapsed = events
        .iter()
        .filter_map(|e| match e {
            StreamEvent::NodeFinished { elapsed, .. } => Some(*elapsed),
            _ => None,
        })
        .max()
        .unwrap_or(Duration::ZERO);

    if let Some(StreamEvent::WorkflowFinished { elapsed, .. }) = events.last() {
        assert!(
            *elapsed >= max_node_elapsed,
            "workflow elapsed {:?} must encompass slowest node {:?}",
            elapsed,
            max_node_elapsed
        );
    } else {
        panic!("last event should be WorkflowFinished");
    }
    Ok(())
}

// ─── 35. 终结事件唯一性:有且仅有一个且位于末尾 ─────────────────────────────

#[tokio::test]
async fn test_exactly_one_terminal_event() -> Result<(), LangGraphError> {
    let count_terminal = |events: &Vec<StreamEvent<DefaultMemoryState>>| {
        events
            .iter()
            .filter(|e| {
                matches!(
                    e,
                    StreamEvent::WorkflowFinished { .. } | StreamEvent::WorkflowError { .. }
                )
            })
            .count()
    };

    // 成功路径
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);
    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    assert_eq!(count_terminal(&events), 1, "success: exactly one terminal");
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));

    // 失败路径
    let mut builder = StateGraphBuilder::new();
    builder.add_node("f", Box::new(FailingNode));
    builder.add_edge(START_NODE, HashSet::from(["f".to_string()]));
    builder.add_edge("f", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);
    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    assert_eq!(count_terminal(&events), 1, "failure: exactly one terminal");
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowError { .. })
    ));
    Ok(())
}

// ─── 补充辅助节点(第二批)───────────────────────────────────────────────

/// 错误类别:用于验证不同错误变体透过流传递的保真度
#[derive(Debug, Clone, Copy)]
enum ErrKind {
    Timeout,
    State,
    Retry,
}

/// 可配置错误节点:返回指定变体的错误
#[derive(Debug, Clone)]
struct ErrorNode {
    kind: ErrKind,
}

#[langgraph4rust::async_trait]
impl AgentNode<DefaultMemoryState> for ErrorNode {
    async fn apply(&self, _state: Arc<DefaultMemoryState>) -> Result<(), LangGraphError> {
        Err(match self.kind {
            ErrKind::Timeout => LangGraphError::Timeout("timed out".into()),
            ErrKind::State => LangGraphError::StateError("state corrupted".into()),
            ErrKind::Retry => LangGraphError::RetryExhausted("retries exhausted".into()),
        })
    }
}

/// 一次写入多个键的节点
#[derive(Debug, Clone)]
struct MultiKeyNode;

#[langgraph4rust::async_trait]
impl AgentNode<DefaultMemoryState> for MultiKeyNode {
    async fn apply(&self, state: Arc<DefaultMemoryState>) -> Result<(), LangGraphError> {
        state.set("k1", 1i32).await?;
        state.set("k2", 2i32).await?;
        state.set("k3", 3i32).await?;
        Ok(())
    }
}

// ─── 36. WorkflowStarted 有且仅发射一次 ────────────────────────────────────

#[tokio::test]
async fn test_workflow_started_emitted_exactly_once() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    let started_count = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::WorkflowStarted))
        .count();
    assert_eq!(
        started_count, 1,
        "WorkflowStarted must be emitted exactly once"
    );
    Ok(())
}

// ─── 37. 错误变体保真度:Timeout/StateError/RetryExhausted 原样传递 ───────────

#[tokio::test]
async fn test_error_variant_fidelity() -> Result<(), LangGraphError> {
    let run = |kind: ErrKind| async move {
        let mut builder = StateGraphBuilder::new();
        builder.add_node("boom", Box::new(ErrorNode { kind }));
        builder.add_edge(START_NODE, HashSet::from(["boom".to_string()]));
        builder.add_edge("boom", HashSet::from([END_NODE.to_string()]));
        let graph = Arc::new(builder.compile().unwrap());
        collect_events(graph, Arc::new(DefaultMemoryState::new())).await
    };

    let e_timeout = run(ErrKind::Timeout).await;
    assert!(matches!(
        extract_error(&e_timeout),
        LangGraphError::Timeout(_)
    ));

    let e_state = run(ErrKind::State).await;
    assert!(matches!(
        extract_error(&e_state),
        LangGraphError::StateError(_)
    ));

    let e_retry = run(ErrKind::Retry).await;
    assert!(matches!(
        extract_error(&e_retry),
        LangGraphError::RetryExhausted(_)
    ));
    Ok(())
}

// ─── 38. 并发流状态隔离:各自 state 互不污染 ────────────────────────────────

#[tokio::test]
async fn test_concurrent_streams_state_isolation() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let s1 = Arc::new(DefaultMemoryState::new());
    let s2 = Arc::new(DefaultMemoryState::new());
    let (e1, e2) = tokio::join!(
        collect_events(Arc::clone(&graph), Arc::clone(&s1)),
        collect_events(Arc::clone(&graph), Arc::clone(&s2)),
    );
    assert!(matches!(
        e1.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    assert!(matches!(
        e2.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));

    // 每个流独立计数为 1,而非共享后的 2 → 证明状态隔离
    let c1: i32 = s1.get("count").await?.unwrap_or(0);
    let c2: i32 = s2.get("count").await?.unwrap_or(0);
    assert_eq!(c1, 1, "stream 1 state must not be contaminated");
    assert_eq!(c2, 1, "stream 2 state must not be contaminated");
    Ok(())
}

// ─── 39. 流终止后重复轮询始终返回 None(幂等终止)───────────────────────

#[tokio::test]
async fn test_stream_termination_is_idempotent() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let mut rx = graph.stream(Arc::new(DefaultMemoryState::new()));
    // 排干所有事件
    while rx.next().await.is_some() {}
    // 终止后多次轮询均为 None
    assert!(rx.next().await.is_none());
    assert!(rx.next().await.is_none());
    assert!(rx.next().await.is_none());
    Ok(())
}

// ─── 40. 并行节点共享同一步骤编号 ──────────────────────────────────────────

#[tokio::test]
async fn test_parallel_nodes_share_step_index() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(
        START_NODE,
        HashSet::from(["a".to_string(), "b".to_string()]),
    );
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    let started_steps: HashSet<usize> = events
        .iter()
        .filter_map(|e| match e {
            StreamEvent::NodeStarted { step, .. } => Some(*step),
            _ => None,
        })
        .collect();
    let finished_steps: HashSet<usize> = events
        .iter()
        .filter_map(|e| match e {
            StreamEvent::NodeFinished { step, .. } => Some(*step),
            _ => None,
        })
        .collect();
    // 两个并行节点同属 step 2
    assert_eq!(
        started_steps,
        HashSet::from([2]),
        "parallel nodes share one step"
    );
    assert_eq!(finished_steps, HashSet::from([2]));
    Ok(())
}

// ─── 41. 节点一次写入多个键均被持久化 ────────────────────────────────────────

#[tokio::test]
async fn test_node_writes_multiple_keys() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("multi", Box::new(MultiKeyNode));
    builder.add_edge(START_NODE, HashSet::from(["multi".to_string()]));
    builder.add_edge("multi", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));

    let k1: i32 = state.get("k1").await?.unwrap_or(0);
    let k2: i32 = state.get("k2").await?.unwrap_or(0);
    let k3: i32 = state.get("k3").await?.unwrap_or(0);
    assert_eq!((k1, k2, k3), (1, 2, 3), "all keys must be persisted");
    Ok(())
}

// ─── 42. 事件计数跨多次运行保持确定性 ────────────────────────────────────────

#[tokio::test]
async fn test_event_count_deterministic_across_runs() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_node("c", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from(["c".to_string()]));
    builder.add_edge("c", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    // N=3 线性图:事件总数 = 3 + 4*3 = 15
    let expected = 3 + 4 * 3;
    for _ in 0..5 {
        let events = collect_events(Arc::clone(&graph), Arc::new(DefaultMemoryState::new())).await;
        assert_eq!(events.len(), expected, "event count must be deterministic");
    }
    Ok(())
}

// ─── 43. 线性图 RoutingDecision 数量 = N + 1 ─────────────────────────────────

#[tokio::test]
async fn test_routing_decision_count_linear() -> Result<(), LangGraphError> {
    // start → a → b → end(N=2 真实节点)
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    let routing_count = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::RoutingDecision { .. }))
        .count();
    // __start__ 路由 + 每个真实节点路由 = N + 1 = 3
    assert_eq!(
        routing_count, 3,
        "linear N=2 graph should have N+1 routing decisions"
    );
    Ok(())
}

// ─── 44. 菱形图 total_steps:start→{a,b}→merge→end = 4 步 ───────────────────

#[tokio::test]
async fn test_diamond_total_steps() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_node("merge", Box::new(CounterNode));
    builder.add_edge(
        START_NODE,
        HashSet::from(["a".to_string(), "b".to_string()]),
    );
    builder.add_edge("a", HashSet::from(["merge".to_string()]));
    builder.add_edge("b", HashSet::from(["merge".to_string()]));
    builder.add_edge("merge", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    match events.last() {
        Some(StreamEvent::WorkflowFinished { total_steps, .. }) => {
            // step1=start路由, step2={a,b}并行, step3=merge, step4=end检测
            assert_eq!(*total_steps, 4, "diamond graph should take 4 steps");
        }
        _ => panic!("expected WorkflowFinished"),
    }
    Ok(())
}

// ─── 45. 慢消费者背压:逐事件延迟不丢失不乱序 ───────────────────────────

#[tokio::test]
async fn test_slow_consumer_no_event_loss() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_node("c", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from(["c".to_string()]));
    builder.add_edge("c", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let mut rx = graph.stream(Arc::new(DefaultMemoryState::new()));
    let mut events = Vec::new();
    while let Some(e) = rx.next().await {
        events.push(e);
        // 慢消费者:每次轮询后休眠,迫使生产者受背压阻塞
        tokio::time::sleep(Duration::from_millis(3)).await;
    }
    // N=3 线性图:3 + 4*3 = 15 个事件,一个不多一个不少
    assert_eq!(events.len(), 15, "slow consumer must not lose events");
    assert!(matches!(events.first(), Some(StreamEvent::WorkflowStarted)));
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    Ok(())
}

// ─── 46. 深线性链压力:50 节点 ───────────────────────────────────────────────

#[tokio::test]
async fn test_deep_linear_chain_stress() -> Result<(), LangGraphError> {
    const N: usize = 50;
    let mut builder = StateGraphBuilder::new();
    let names: Vec<String> = (0..N).map(|i| format!("n{i}")).collect();
    for name in &names {
        builder.add_node(name, Box::new(CounterNode));
    }
    builder.add_edge(START_NODE, HashSet::from([names[0].clone()]));
    for w in names.windows(2) {
        builder.add_edge(&w[0], HashSet::from([w[1].clone()]));
    }
    builder.add_edge(&names[N - 1], HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert_eq!(
        events.len(),
        3 + 4 * N,
        "event count formula must hold for deep chain"
    );
    if let Some(StreamEvent::WorkflowFinished { total_steps, .. }) = events.last() {
        assert_eq!(*total_steps, N + 2);
    } else {
        panic!("expected WorkflowFinished");
    }
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, N as i32, "every node should have incremented count");
    Ok(())
}

// ─── 47. 并行节点写入不同键均可见 ────────────────────────────────────────────

#[tokio::test]
async fn test_parallel_nodes_write_distinct_keys() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node(
        "wx",
        Box::new(SetIntNode {
            key: "x".to_string(),
            value: 100,
        }),
    );
    builder.add_node(
        "wy",
        Box::new(SetIntNode {
            key: "y".to_string(),
            value: 200,
        }),
    );
    builder.add_edge(
        START_NODE,
        HashSet::from(["wx".to_string(), "wy".to_string()]),
    );
    builder.add_edge("wx", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("wy", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;
    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));

    let x: i32 = state.get("x").await?.unwrap_or(0);
    let y: i32 = state.get("y").await?.unwrap_or(0);
    assert_eq!((x, y), (100, 200), "both parallel writes must be visible");
    Ok(())
}

// ─── 48. 图复用:不同初始状态产生不同结果 ────────────────────────────────────

#[tokio::test]
async fn test_graph_reuse_with_different_initial_state() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    // 初始 count=10 → 执行后 11
    let s1 = Arc::new(DefaultMemoryState::new());
    s1.set("count", 10i32).await?;
    let _ = collect_events(Arc::clone(&graph), Arc::clone(&s1)).await;
    let c1: i32 = s1.get("count").await?.unwrap_or(0);
    assert_eq!(c1, 11);

    // 全新状态 → 1
    let s2 = Arc::new(DefaultMemoryState::new());
    let _ = collect_events(Arc::clone(&graph), Arc::clone(&s2)).await;
    let c2: i32 = s2.get("count").await?.unwrap_or(0);
    assert_eq!(c2, 1);
    Ok(())
}

// ─── 49. 并发流混合成败:同图上一成功一失败互不干扰 ───────────────────────

#[tokio::test]
async fn test_concurrent_streams_mixed_success_failure() -> Result<(), LangGraphError> {
    // 成功图
    let mut ok_builder = StateGraphBuilder::new();
    ok_builder.add_node("a", Box::new(CounterNode));
    ok_builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    ok_builder.add_edge("a", HashSet::from([END_NODE.to_string()]));
    let ok_graph = Arc::new(ok_builder.compile()?);

    // 失败图
    let mut fail_builder = StateGraphBuilder::new();
    fail_builder.add_node("f", Box::new(FailingNode));
    fail_builder.add_edge(START_NODE, HashSet::from(["f".to_string()]));
    fail_builder.add_edge("f", HashSet::from([END_NODE.to_string()]));
    let fail_graph = Arc::new(fail_builder.compile()?);

    let (ok_events, fail_events) = tokio::join!(
        collect_events(Arc::clone(&ok_graph), Arc::new(DefaultMemoryState::new())),
        collect_events(Arc::clone(&fail_graph), Arc::new(DefaultMemoryState::new())),
    );
    assert!(matches!(
        ok_events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    assert!(matches!(
        fail_events.last(),
        Some(StreamEvent::WorkflowError { .. })
    ));
    Ok(())
}

// ─── 50. 跨步顺序不变量:step N 的 RoutingDecision 先于 step N+1 的 StepStarted ───

#[tokio::test]
async fn test_cross_step_event_ordering() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["a".to_string()]));
    builder.add_edge("a", HashSet::from(["b".to_string()]));
    builder.add_edge("b", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // RoutingDecision{step:2} 必须出现在 StepStarted{step:3} 之前
    let route2 = events
        .iter()
        .position(|e| matches!(e, StreamEvent::RoutingDecision { step: 2, .. }));
    let step3 = events
        .iter()
        .position(|e| matches!(e, StreamEvent::StepStarted { step: 3, .. }));
    match (route2, step3) {
        (Some(r), Some(s)) => assert!(
            r < s,
            "routing of step N must precede StepStarted of step N+1"
        ),
        _ => panic!("both events should exist"),
    }
    Ok(())
}

// ─── 51. 多级条件路由链:连续两步条件决策 ────────────────────────────────────

#[tokio::test]
async fn test_conditional_chain_multiple_steps() -> Result<(), LangGraphError> {
    // start → r1 ─(cond)→ r2 ─(cond)→ end
    let mut builder = StateGraphBuilder::new();
    builder.add_node("r1", Box::new(RouterNode));
    builder.add_node("r2", Box::new(RouterNode));
    builder.add_edge(START_NODE, HashSet::from(["r1".to_string()]));
    builder.add_conditional_edge(
        "r1",
        vec![Box::new(|_s: &DefaultMemoryState| "r2".to_string())],
    );
    builder.add_conditional_edge(
        "r2",
        vec![Box::new(|_s: &DefaultMemoryState| END_NODE.to_string())],
    );
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    // r1 和 r2 都应被执行
    assert!(
        events
            .iter()
            .any(|e| matches!(e, StreamEvent::NodeStarted { name, .. } if name == "r1"))
    );
    assert!(
        events
            .iter()
            .any(|e| matches!(e, StreamEvent::NodeStarted { name, .. } if name == "r2"))
    );
    // 共 3 条 RoutingDecision:start→r1, r1→r2, r2→end
    let routing_count = events
        .iter()
        .filter(|e| matches!(e, StreamEvent::RoutingDecision { .. }))
        .count();
    assert_eq!(routing_count, 3);
    Ok(())
}

// ─── 52. 并行执行中弃流:图不被污染,仍可复用 ────────────────────────────────

#[tokio::test]
async fn test_abandoned_stream_does_not_poison_graph() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("s1", Box::new(SlowNode { ms: 150 }));
    builder.add_node("s2", Box::new(SlowNode { ms: 150 }));
    builder.add_edge(
        START_NODE,
        HashSet::from(["s1".to_string(), "s2".to_string()]),
    );
    builder.add_edge("s1", HashSet::from([END_NODE.to_string()]));
    builder.add_edge("s2", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    // 在并行慢节点执行期间丢弃接收方
    let mut rx = Arc::clone(&graph).stream(Arc::new(DefaultMemoryState::new()));
    let _ = rx.next().await; // WorkflowStarted
    drop(rx);
    tokio::time::sleep(Duration::from_millis(30)).await;

    // 同一图仍可正常跑完一个新流
    let events = collect_events(Arc::clone(&graph), Arc::new(DefaultMemoryState::new())).await;
    assert!(
        matches!(events.last(), Some(StreamEvent::WorkflowFinished { .. })),
        "graph must remain usable after an abandoned stream"
    );
    Ok(())
}

// ─── 53. NodeFinished.elapsed 不小于节点自身休眠时长 ─────────────────────────

#[tokio::test]
async fn test_node_finished_elapsed_lower_bound() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("slow", Box::new(SlowNode { ms: 60 }));
    builder.add_edge(START_NODE, HashSet::from(["slow".to_string()]));
    builder.add_edge("slow", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    let elapsed = events.iter().find_map(|e| match e {
        StreamEvent::NodeFinished { name, elapsed, .. } if name == "slow" => Some(*elapsed),
        _ => None,
    });
    match elapsed {
        Some(d) => assert!(
            d >= Duration::from_millis(55),
            "elapsed {:?} should reflect the 60ms sleep",
            d
        ),
        None => panic!("NodeFinished for slow node should exist"),
    }
    Ok(())
}

// ─── 54. 首个真实节点即失败:WorkflowError.step == 2 ─────────────────────────

#[tokio::test]
async fn test_failure_at_first_real_node_step() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("f", Box::new(FailingNode));
    builder.add_edge(START_NODE, HashSet::from(["f".to_string()]));
    builder.add_edge("f", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;
    match events.last() {
        Some(StreamEvent::WorkflowError { step, .. }) => {
            // __start__ 占 step1,首个真实节点 f 在 step2 失败
            assert_eq!(*step, 2, "first real node fails at step 2");
        }
        _ => panic!("expected WorkflowError"),
    }
    Ok(())
}

// ─── 55. 多起始节点流式执行 ────────────────────────────────────────────────

/// 验证 add_start_node 添加的多个起始节点在流式执行中都能正确工作
#[tokio::test]
async fn test_stream_multi_start_nodes() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("a", Box::new(CounterNode));
    builder.add_node("b", Box::new(CounterNode));
    builder.add_node("merge", Box::new(CounterNode));
    builder.set_start_node("a");
    builder.add_start_node("b");
    builder.add_edge("a", HashSet::from(["merge".to_string()]));
    builder.add_edge("b", HashSet::from(["merge".to_string()]));
    builder.add_edge("merge", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    // a 和 b 并行执行,merge 执行一次
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, 3, "a, b, merge should all execute");

    // 并行步应包含 a 和 b
    let step_started = events.iter().find(|e| {
        matches!(
            e,
            StreamEvent::StepStarted { nodes, .. } if nodes.len() == 2
        )
    });
    assert!(
        step_started.is_some(),
        "should have a step with 2 parallel nodes"
    );
    Ok(())
}

// ─── 56. 自定义结束节点流式执行 ────────────────────────────────────────────

/// 验证 set_end_node 自定义结束节点在流式执行中正常工作
#[tokio::test]
async fn test_stream_custom_end_node() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.set_end_node("finish");
    builder.add_node("step", Box::new(CounterNode));
    builder.add_edge(START_NODE, HashSet::from(["step".to_string()]));
    builder.add_edge("step", HashSet::from(["finish".to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(DefaultMemoryState::new());
    let events = collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    let count: i32 = state.get("count").await?.unwrap_or(0);
    assert_eq!(count, 1, "single step should execute");

    // 路由决策应包含自定义结束节点
    let routing = events.iter().find(|e| matches!(
        e,
        StreamEvent::RoutingDecision { to_nodes, .. } if to_nodes.contains(&"finish".to_string())
    ));
    assert!(
        routing.is_some(),
        "should have routing decision to custom end node 'finish'"
    );
    Ok(())
}

// ─── 57. StreamEvent Debug 格式化 ──────────────────────────────────────────

/// 简单的 Debug 状态实现,用于测试 StreamEvent 的 Debug 格式化
#[derive(Debug, Clone)]
struct DebugState;

#[langgraph4rust::async_trait]
impl AgentState for DebugState {
    async fn get<T: serde::de::DeserializeOwned + Send + Sync>(
        &self,
        _key: &str,
    ) -> Result<Option<T>, LangGraphError> {
        Ok(None)
    }
    async fn set<T: serde::Serialize + Send + Sync>(
        &self,
        _key: &str,
        _value: T,
    ) -> Result<bool, LangGraphError> {
        Ok(true)
    }

    async fn snapshot(&self, step: usize, node_keys: Vec<String>) -> Result<(), ()> {
        Ok(())
    }
}

/// 验证所有 StreamEvent 变体的 Debug 输出都包含有意义的信息
#[test]
fn test_stream_event_debug_format() {
    let events: Vec<StreamEvent<DebugState>> = vec![
        StreamEvent::WorkflowStarted,
        StreamEvent::StepStarted {
            step: 1,
            nodes: vec!["a".to_string()],
        },
        StreamEvent::NodeStarted {
            step: 1,
            name: "a".to_string(),
        },
        StreamEvent::NodeFinished {
            step: 1,
            name: "a".to_string(),
            elapsed: std::time::Duration::from_millis(10),
        },
        StreamEvent::RoutingDecision {
            step: 1,
            from_nodes: vec!["a".to_string()],
            to_nodes: vec!["b".to_string()],
        },
        StreamEvent::WorkflowFinished {
            state: Arc::new(DebugState),
            total_steps: 3,
            elapsed: std::time::Duration::from_millis(50),
        },
        StreamEvent::WorkflowError {
            state: Arc::new(DebugState),
            step: 2,
            error: LangGraphError::NodeError("test".into()),
        },
    ];

    for event in &events {
        let debug = format!("{:?}", event);
        assert!(
            !debug.is_empty(),
            "Debug output should not be empty for event variant"
        );
    }

    // 验证具体变体包含关键信息
    assert!(format!("{:?}", &events[0]).contains("WorkflowStarted"));
    assert!(format!("{:?}", &events[1]).contains("StepStarted"));
    assert!(format!("{:?}", &events[2]).contains("NodeStarted"));
    assert!(format!("{:?}", &events[3]).contains("NodeFinished"));
    assert!(format!("{:?}", &events[4]).contains("RoutingDecision"));
    assert!(format!("{:?}", &events[5]).contains("WorkflowFinished"));
    assert!(format!("{:?}", &events[6]).contains("WorkflowError"));
}

// ─── 58. run_driver 节点查找失败 ───────────────────────────────────────────

/// 验证当节点查找失败时(如条件边返回不存在的节点),流式执行产生 WorkflowError
#[tokio::test]
async fn test_stream_node_lookup_failure() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::new();
    builder.add_node("router", Box::new(RouterNode));
    builder.add_edge(START_NODE, HashSet::from(["router".to_string()]));
    // 条件边返回一个不存在的节点,但 router 被执行后,下一轮 get_node_by_keys
    // 会尝试查找 ghost 节点,find 不到则 nodes 为空
    builder.add_conditional_edge(
        "router",
        vec![Box::new(|_state: &DefaultMemoryState| "ghost".to_string())],
    );
    let graph = Arc::new(builder.compile()?);

    let events = collect_events(graph, Arc::new(DefaultMemoryState::new())).await;

    // 应该收到 WorkflowError,因为 ghost 不是已注册节点,导致循环无法到达 end_node
    match events.last() {
        Some(StreamEvent::WorkflowError { error, .. }) => {
            let msg = error.to_string();
            assert!(
                msg.contains("Reached max_steps") || msg.contains("ghost"),
                "error should indicate graph issue, got: {}",
                msg
            );
        }
        other => {
            panic!("expected WorkflowError, got: {:?}", other.map(|_| ()));
        }
    }
    Ok(())
}

// ─── 59. 流式执行 + 自定义 AgentState ──────────────────────────────────────

/// 自定义状态实现:用于流式执行测试
#[derive(Debug, Clone)]
struct CounterState {
    data: Arc<std::sync::Mutex<std::collections::HashMap<String, serde_json::Value>>>,
}

impl CounterState {
    fn new() -> Self {
        Self {
            data: Arc::new(std::sync::Mutex::new(std::collections::HashMap::new())),
        }
    }
}

#[langgraph4rust::async_trait]
impl AgentState for CounterState {
    async fn get<T: serde::de::DeserializeOwned + Send + Sync>(
        &self,
        key: &str,
    ) -> Result<Option<T>, LangGraphError> {
        let guard = self.data.lock().unwrap();
        Ok(guard
            .get(key)
            .and_then(|v| serde_json::from_value(v.clone()).ok()))
    }
    async fn set<T: serde::Serialize + Send + Sync>(
        &self,
        key: &str,
        value: T,
    ) -> Result<bool, LangGraphError> {
        let v =
            serde_json::to_value(value).map_err(|e| LangGraphError::StateError(e.to_string()))?;
        self.data.lock().unwrap().insert(key.to_string(), v);
        Ok(true)
    }

    async fn snapshot(&self, step: usize, node_keys: Vec<String>) -> Result<(), ()> {
        Ok(())
    }
}

/// 自定义状态节点:写入固定值
#[derive(Debug, Clone)]
struct SetValueNode {
    key: String,
    value: i32,
}

#[langgraph4rust::async_trait]
impl AgentNode<CounterState> for SetValueNode {
    async fn apply(&self, state: Arc<CounterState>) -> Result<(), LangGraphError> {
        state.set(&self.key, self.value).await?;
        Ok(())
    }
}

/// 验证流式执行能使用自定义 AgentState 实现
#[tokio::test]
async fn test_stream_with_custom_agent_state() -> Result<(), LangGraphError> {
    let mut builder = StateGraphBuilder::<CounterState>::new();
    builder.add_node(
        "init",
        Box::new(SetValueNode {
            key: "n".to_string(),
            value: 42,
        }),
    );
    builder.add_node(
        "double",
        Box::new(SetValueNode {
            key: "n2".to_string(),
            value: 84,
        }),
    );
    builder.add_edge(START_NODE, HashSet::from(["init".to_string()]));
    builder.add_edge("init", HashSet::from(["double".to_string()]));
    builder.add_edge("double", HashSet::from([END_NODE.to_string()]));
    let graph = Arc::new(builder.compile()?);

    let state = Arc::new(CounterState::new());
    let events: Vec<StreamEvent<CounterState>> =
        collect_events(Arc::clone(&graph), Arc::clone(&state)).await;

    assert!(matches!(
        events.last(),
        Some(StreamEvent::WorkflowFinished { .. })
    ));
    // 验证事件序列包含关键事件
    assert!(
        events
            .iter()
            .any(|e| matches!(e, StreamEvent::WorkflowStarted))
    );
    assert!(
        events
            .iter()
            .any(|e| matches!(e, StreamEvent::NodeStarted { name, .. } if name == "init"))
    );
    assert!(
        events
            .iter()
            .any(|e| matches!(e, StreamEvent::NodeFinished { name, .. } if name == "init"))
    );

    // 验证自定义状态的数据被正确写入
    let n: i32 = state.get("n").await?.unwrap_or(0);
    let n2: i32 = state.get("n2").await?.unwrap_or(0);
    assert_eq!(n, 42, "init node should write 42");
    assert_eq!(n2, 84, "double node should write 84");
    Ok(())
}