@langchain/langgraph 1.0.7 → 1.0.12

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (383) hide show
  1. package/package.json +7 -7
  2. package/CHANGELOG.md +0 -286
  3. package/dist/_virtual/rolldown_runtime.cjs +0 -25
  4. package/dist/channels/any_value.cjs +0 -46
  5. package/dist/channels/any_value.cjs.map +0 -1
  6. package/dist/channels/any_value.d.cts +0 -24
  7. package/dist/channels/any_value.d.cts.map +0 -1
  8. package/dist/channels/any_value.d.ts +0 -24
  9. package/dist/channels/any_value.d.ts.map +0 -1
  10. package/dist/channels/any_value.js +0 -46
  11. package/dist/channels/any_value.js.map +0 -1
  12. package/dist/channels/base.cjs +0 -102
  13. package/dist/channels/base.cjs.map +0 -1
  14. package/dist/channels/base.d.cts +0 -79
  15. package/dist/channels/base.d.cts.map +0 -1
  16. package/dist/channels/base.d.ts +0 -79
  17. package/dist/channels/base.d.ts.map +0 -1
  18. package/dist/channels/base.js +0 -97
  19. package/dist/channels/base.js.map +0 -1
  20. package/dist/channels/binop.cjs +0 -49
  21. package/dist/channels/binop.cjs.map +0 -1
  22. package/dist/channels/binop.d.cts +0 -22
  23. package/dist/channels/binop.d.cts.map +0 -1
  24. package/dist/channels/binop.d.ts +0 -22
  25. package/dist/channels/binop.d.ts.map +0 -1
  26. package/dist/channels/binop.js +0 -49
  27. package/dist/channels/binop.js.map +0 -1
  28. package/dist/channels/dynamic_barrier_value.cjs +0 -76
  29. package/dist/channels/dynamic_barrier_value.cjs.map +0 -1
  30. package/dist/channels/dynamic_barrier_value.d.cts +0 -42
  31. package/dist/channels/dynamic_barrier_value.d.cts.map +0 -1
  32. package/dist/channels/dynamic_barrier_value.d.ts +0 -42
  33. package/dist/channels/dynamic_barrier_value.d.ts.map +0 -1
  34. package/dist/channels/dynamic_barrier_value.js +0 -76
  35. package/dist/channels/dynamic_barrier_value.js.map +0 -1
  36. package/dist/channels/ephemeral_value.cjs +0 -46
  37. package/dist/channels/ephemeral_value.cjs.map +0 -1
  38. package/dist/channels/ephemeral_value.d.cts +0 -22
  39. package/dist/channels/ephemeral_value.d.cts.map +0 -1
  40. package/dist/channels/ephemeral_value.d.ts +0 -22
  41. package/dist/channels/ephemeral_value.d.ts.map +0 -1
  42. package/dist/channels/ephemeral_value.js +0 -46
  43. package/dist/channels/ephemeral_value.js.map +0 -1
  44. package/dist/channels/index.cjs +0 -21
  45. package/dist/channels/index.d.cts +0 -9
  46. package/dist/channels/index.d.ts +0 -9
  47. package/dist/channels/index.js +0 -10
  48. package/dist/channels/last_value.cjs +0 -98
  49. package/dist/channels/last_value.cjs.map +0 -1
  50. package/dist/channels/last_value.d.cts +0 -44
  51. package/dist/channels/last_value.d.cts.map +0 -1
  52. package/dist/channels/last_value.d.ts +0 -44
  53. package/dist/channels/last_value.d.ts.map +0 -1
  54. package/dist/channels/last_value.js +0 -97
  55. package/dist/channels/last_value.js.map +0 -1
  56. package/dist/channels/named_barrier_value.cjs +0 -118
  57. package/dist/channels/named_barrier_value.cjs.map +0 -1
  58. package/dist/channels/named_barrier_value.d.cts +0 -46
  59. package/dist/channels/named_barrier_value.d.cts.map +0 -1
  60. package/dist/channels/named_barrier_value.d.ts +0 -46
  61. package/dist/channels/named_barrier_value.d.ts.map +0 -1
  62. package/dist/channels/named_barrier_value.js +0 -116
  63. package/dist/channels/named_barrier_value.js.map +0 -1
  64. package/dist/channels/topic.cjs +0 -65
  65. package/dist/channels/topic.cjs.map +0 -1
  66. package/dist/channels/topic.d.cts +0 -32
  67. package/dist/channels/topic.d.cts.map +0 -1
  68. package/dist/channels/topic.d.ts +0 -32
  69. package/dist/channels/topic.d.ts.map +0 -1
  70. package/dist/channels/topic.js +0 -65
  71. package/dist/channels/topic.js.map +0 -1
  72. package/dist/constants.cjs +0 -406
  73. package/dist/constants.cjs.map +0 -1
  74. package/dist/constants.d.cts +0 -285
  75. package/dist/constants.d.cts.map +0 -1
  76. package/dist/constants.d.ts +0 -285
  77. package/dist/constants.d.ts.map +0 -1
  78. package/dist/constants.js +0 -362
  79. package/dist/constants.js.map +0 -1
  80. package/dist/errors.cjs +0 -163
  81. package/dist/errors.cjs.map +0 -1
  82. package/dist/errors.d.cts +0 -81
  83. package/dist/errors.d.cts.map +0 -1
  84. package/dist/errors.d.ts +0 -81
  85. package/dist/errors.d.ts.map +0 -1
  86. package/dist/errors.js +0 -146
  87. package/dist/errors.js.map +0 -1
  88. package/dist/func/index.cjs +0 -301
  89. package/dist/func/index.cjs.map +0 -1
  90. package/dist/func/index.d.cts +0 -293
  91. package/dist/func/index.d.cts.map +0 -1
  92. package/dist/func/index.d.ts +0 -293
  93. package/dist/func/index.d.ts.map +0 -1
  94. package/dist/func/index.js +0 -298
  95. package/dist/func/index.js.map +0 -1
  96. package/dist/func/types.d.cts +0 -64
  97. package/dist/func/types.d.cts.map +0 -1
  98. package/dist/func/types.d.ts +0 -64
  99. package/dist/func/types.d.ts.map +0 -1
  100. package/dist/graph/annotation.cjs +0 -101
  101. package/dist/graph/annotation.cjs.map +0 -1
  102. package/dist/graph/annotation.d.cts +0 -116
  103. package/dist/graph/annotation.d.cts.map +0 -1
  104. package/dist/graph/annotation.d.ts +0 -116
  105. package/dist/graph/annotation.d.ts.map +0 -1
  106. package/dist/graph/annotation.js +0 -99
  107. package/dist/graph/annotation.js.map +0 -1
  108. package/dist/graph/graph.cjs +0 -423
  109. package/dist/graph/graph.cjs.map +0 -1
  110. package/dist/graph/graph.d.cts +0 -132
  111. package/dist/graph/graph.d.cts.map +0 -1
  112. package/dist/graph/graph.d.ts +0 -132
  113. package/dist/graph/graph.d.ts.map +0 -1
  114. package/dist/graph/graph.js +0 -420
  115. package/dist/graph/graph.js.map +0 -1
  116. package/dist/graph/index.cjs +0 -5
  117. package/dist/graph/index.js +0 -7
  118. package/dist/graph/message.cjs +0 -99
  119. package/dist/graph/message.cjs.map +0 -1
  120. package/dist/graph/message.d.cts +0 -40
  121. package/dist/graph/message.d.cts.map +0 -1
  122. package/dist/graph/message.d.ts +0 -40
  123. package/dist/graph/message.d.ts.map +0 -1
  124. package/dist/graph/message.js +0 -95
  125. package/dist/graph/message.js.map +0 -1
  126. package/dist/graph/messages_annotation.cjs +0 -110
  127. package/dist/graph/messages_annotation.cjs.map +0 -1
  128. package/dist/graph/messages_annotation.d.cts +0 -112
  129. package/dist/graph/messages_annotation.d.cts.map +0 -1
  130. package/dist/graph/messages_annotation.d.ts +0 -112
  131. package/dist/graph/messages_annotation.d.ts.map +0 -1
  132. package/dist/graph/messages_annotation.js +0 -107
  133. package/dist/graph/messages_annotation.js.map +0 -1
  134. package/dist/graph/state.cjs +0 -501
  135. package/dist/graph/state.cjs.map +0 -1
  136. package/dist/graph/state.d.cts +0 -236
  137. package/dist/graph/state.d.cts.map +0 -1
  138. package/dist/graph/state.d.ts +0 -236
  139. package/dist/graph/state.d.ts.map +0 -1
  140. package/dist/graph/state.js +0 -499
  141. package/dist/graph/state.js.map +0 -1
  142. package/dist/graph/zod/index.cjs +0 -10
  143. package/dist/graph/zod/index.d.cts +0 -3
  144. package/dist/graph/zod/index.d.ts +0 -3
  145. package/dist/graph/zod/index.js +0 -5
  146. package/dist/graph/zod/meta.cjs +0 -145
  147. package/dist/graph/zod/meta.cjs.map +0 -1
  148. package/dist/graph/zod/meta.d.cts +0 -116
  149. package/dist/graph/zod/meta.d.cts.map +0 -1
  150. package/dist/graph/zod/meta.d.ts +0 -116
  151. package/dist/graph/zod/meta.d.ts.map +0 -1
  152. package/dist/graph/zod/meta.js +0 -141
  153. package/dist/graph/zod/meta.js.map +0 -1
  154. package/dist/graph/zod/plugin.cjs +0 -41
  155. package/dist/graph/zod/plugin.cjs.map +0 -1
  156. package/dist/graph/zod/plugin.js +0 -41
  157. package/dist/graph/zod/plugin.js.map +0 -1
  158. package/dist/graph/zod/schema.cjs +0 -99
  159. package/dist/graph/zod/schema.cjs.map +0 -1
  160. package/dist/graph/zod/schema.d.cts +0 -38
  161. package/dist/graph/zod/schema.d.cts.map +0 -1
  162. package/dist/graph/zod/schema.d.ts +0 -38
  163. package/dist/graph/zod/schema.d.ts.map +0 -1
  164. package/dist/graph/zod/schema.js +0 -94
  165. package/dist/graph/zod/schema.js.map +0 -1
  166. package/dist/graph/zod/zod-registry.cjs +0 -43
  167. package/dist/graph/zod/zod-registry.cjs.map +0 -1
  168. package/dist/graph/zod/zod-registry.d.cts +0 -51
  169. package/dist/graph/zod/zod-registry.d.cts.map +0 -1
  170. package/dist/graph/zod/zod-registry.d.ts +0 -51
  171. package/dist/graph/zod/zod-registry.d.ts.map +0 -1
  172. package/dist/graph/zod/zod-registry.js +0 -41
  173. package/dist/graph/zod/zod-registry.js.map +0 -1
  174. package/dist/hash.cjs +0 -271
  175. package/dist/hash.cjs.map +0 -1
  176. package/dist/hash.js +0 -269
  177. package/dist/hash.js.map +0 -1
  178. package/dist/index.cjs +0 -112
  179. package/dist/index.cjs.map +0 -1
  180. package/dist/index.d.cts +0 -26
  181. package/dist/index.d.ts +0 -26
  182. package/dist/index.js +0 -22
  183. package/dist/index.js.map +0 -1
  184. package/dist/interrupt.cjs +0 -82
  185. package/dist/interrupt.cjs.map +0 -1
  186. package/dist/interrupt.d.cts +0 -58
  187. package/dist/interrupt.d.cts.map +0 -1
  188. package/dist/interrupt.d.ts +0 -58
  189. package/dist/interrupt.d.ts.map +0 -1
  190. package/dist/interrupt.js +0 -81
  191. package/dist/interrupt.js.map +0 -1
  192. package/dist/prebuilt/agentName.cjs +0 -153
  193. package/dist/prebuilt/agentName.cjs.map +0 -1
  194. package/dist/prebuilt/agentName.d.cts +0 -42
  195. package/dist/prebuilt/agentName.d.cts.map +0 -1
  196. package/dist/prebuilt/agentName.d.ts +0 -42
  197. package/dist/prebuilt/agentName.d.ts.map +0 -1
  198. package/dist/prebuilt/agentName.js +0 -152
  199. package/dist/prebuilt/agentName.js.map +0 -1
  200. package/dist/prebuilt/agent_executor.cjs +0 -44
  201. package/dist/prebuilt/agent_executor.cjs.map +0 -1
  202. package/dist/prebuilt/agent_executor.d.cts +0 -58
  203. package/dist/prebuilt/agent_executor.d.cts.map +0 -1
  204. package/dist/prebuilt/agent_executor.d.ts +0 -58
  205. package/dist/prebuilt/agent_executor.d.ts.map +0 -1
  206. package/dist/prebuilt/agent_executor.js +0 -44
  207. package/dist/prebuilt/agent_executor.js.map +0 -1
  208. package/dist/prebuilt/chat_agent_executor.cjs +0 -68
  209. package/dist/prebuilt/chat_agent_executor.cjs.map +0 -1
  210. package/dist/prebuilt/chat_agent_executor.d.cts +0 -23
  211. package/dist/prebuilt/chat_agent_executor.d.cts.map +0 -1
  212. package/dist/prebuilt/chat_agent_executor.d.ts +0 -23
  213. package/dist/prebuilt/chat_agent_executor.d.ts.map +0 -1
  214. package/dist/prebuilt/chat_agent_executor.js +0 -67
  215. package/dist/prebuilt/chat_agent_executor.js.map +0 -1
  216. package/dist/prebuilt/index.cjs +0 -15
  217. package/dist/prebuilt/index.d.cts +0 -8
  218. package/dist/prebuilt/index.d.ts +0 -8
  219. package/dist/prebuilt/index.js +0 -8
  220. package/dist/prebuilt/interrupt.d.cts +0 -61
  221. package/dist/prebuilt/interrupt.d.cts.map +0 -1
  222. package/dist/prebuilt/interrupt.d.ts +0 -61
  223. package/dist/prebuilt/interrupt.d.ts.map +0 -1
  224. package/dist/prebuilt/react_agent_executor.cjs +0 -344
  225. package/dist/prebuilt/react_agent_executor.cjs.map +0 -1
  226. package/dist/prebuilt/react_agent_executor.d.cts +0 -230
  227. package/dist/prebuilt/react_agent_executor.d.cts.map +0 -1
  228. package/dist/prebuilt/react_agent_executor.d.ts +0 -230
  229. package/dist/prebuilt/react_agent_executor.d.ts.map +0 -1
  230. package/dist/prebuilt/react_agent_executor.js +0 -342
  231. package/dist/prebuilt/react_agent_executor.js.map +0 -1
  232. package/dist/prebuilt/tool_executor.cjs +0 -48
  233. package/dist/prebuilt/tool_executor.cjs.map +0 -1
  234. package/dist/prebuilt/tool_executor.d.cts +0 -42
  235. package/dist/prebuilt/tool_executor.d.cts.map +0 -1
  236. package/dist/prebuilt/tool_executor.d.ts +0 -42
  237. package/dist/prebuilt/tool_executor.d.ts.map +0 -1
  238. package/dist/prebuilt/tool_executor.js +0 -47
  239. package/dist/prebuilt/tool_executor.js.map +0 -1
  240. package/dist/prebuilt/tool_node.cjs +0 -248
  241. package/dist/prebuilt/tool_node.cjs.map +0 -1
  242. package/dist/prebuilt/tool_node.d.cts +0 -182
  243. package/dist/prebuilt/tool_node.d.cts.map +0 -1
  244. package/dist/prebuilt/tool_node.d.ts +0 -182
  245. package/dist/prebuilt/tool_node.d.ts.map +0 -1
  246. package/dist/prebuilt/tool_node.js +0 -246
  247. package/dist/prebuilt/tool_node.js.map +0 -1
  248. package/dist/pregel/algo.cjs +0 -573
  249. package/dist/pregel/algo.cjs.map +0 -1
  250. package/dist/pregel/algo.d.cts +0 -13
  251. package/dist/pregel/algo.d.cts.map +0 -1
  252. package/dist/pregel/algo.d.ts +0 -13
  253. package/dist/pregel/algo.d.ts.map +0 -1
  254. package/dist/pregel/algo.js +0 -567
  255. package/dist/pregel/algo.js.map +0 -1
  256. package/dist/pregel/call.cjs +0 -53
  257. package/dist/pregel/call.cjs.map +0 -1
  258. package/dist/pregel/call.js +0 -50
  259. package/dist/pregel/call.js.map +0 -1
  260. package/dist/pregel/debug.cjs +0 -175
  261. package/dist/pregel/debug.cjs.map +0 -1
  262. package/dist/pregel/debug.js +0 -169
  263. package/dist/pregel/debug.js.map +0 -1
  264. package/dist/pregel/index.cjs +0 -1170
  265. package/dist/pregel/index.cjs.map +0 -1
  266. package/dist/pregel/index.d.cts +0 -546
  267. package/dist/pregel/index.d.cts.map +0 -1
  268. package/dist/pregel/index.d.ts +0 -546
  269. package/dist/pregel/index.d.ts.map +0 -1
  270. package/dist/pregel/index.js +0 -1168
  271. package/dist/pregel/index.js.map +0 -1
  272. package/dist/pregel/io.cjs +0 -140
  273. package/dist/pregel/io.cjs.map +0 -1
  274. package/dist/pregel/io.js +0 -135
  275. package/dist/pregel/io.js.map +0 -1
  276. package/dist/pregel/loop.cjs +0 -548
  277. package/dist/pregel/loop.cjs.map +0 -1
  278. package/dist/pregel/loop.js +0 -547
  279. package/dist/pregel/loop.js.map +0 -1
  280. package/dist/pregel/messages.cjs +0 -108
  281. package/dist/pregel/messages.cjs.map +0 -1
  282. package/dist/pregel/messages.js +0 -107
  283. package/dist/pregel/messages.js.map +0 -1
  284. package/dist/pregel/read.cjs +0 -152
  285. package/dist/pregel/read.cjs.map +0 -1
  286. package/dist/pregel/read.d.cts +0 -51
  287. package/dist/pregel/read.d.cts.map +0 -1
  288. package/dist/pregel/read.d.ts +0 -51
  289. package/dist/pregel/read.d.ts.map +0 -1
  290. package/dist/pregel/read.js +0 -150
  291. package/dist/pregel/read.js.map +0 -1
  292. package/dist/pregel/remote.cjs +0 -349
  293. package/dist/pregel/remote.cjs.map +0 -1
  294. package/dist/pregel/remote.d.cts +0 -123
  295. package/dist/pregel/remote.d.cts.map +0 -1
  296. package/dist/pregel/remote.d.ts +0 -123
  297. package/dist/pregel/remote.d.ts.map +0 -1
  298. package/dist/pregel/remote.js +0 -348
  299. package/dist/pregel/remote.js.map +0 -1
  300. package/dist/pregel/retry.cjs +0 -92
  301. package/dist/pregel/retry.cjs.map +0 -1
  302. package/dist/pregel/retry.js +0 -92
  303. package/dist/pregel/retry.js.map +0 -1
  304. package/dist/pregel/runnable_types.d.cts +0 -49
  305. package/dist/pregel/runnable_types.d.cts.map +0 -1
  306. package/dist/pregel/runnable_types.d.ts +0 -49
  307. package/dist/pregel/runnable_types.d.ts.map +0 -1
  308. package/dist/pregel/runner.cjs +0 -228
  309. package/dist/pregel/runner.cjs.map +0 -1
  310. package/dist/pregel/runner.js +0 -228
  311. package/dist/pregel/runner.js.map +0 -1
  312. package/dist/pregel/stream.cjs +0 -199
  313. package/dist/pregel/stream.cjs.map +0 -1
  314. package/dist/pregel/stream.js +0 -196
  315. package/dist/pregel/stream.js.map +0 -1
  316. package/dist/pregel/types.cjs +0 -27
  317. package/dist/pregel/types.cjs.map +0 -1
  318. package/dist/pregel/types.d.cts +0 -453
  319. package/dist/pregel/types.d.cts.map +0 -1
  320. package/dist/pregel/types.d.ts +0 -453
  321. package/dist/pregel/types.d.ts.map +0 -1
  322. package/dist/pregel/types.js +0 -25
  323. package/dist/pregel/types.js.map +0 -1
  324. package/dist/pregel/utils/config.cjs +0 -122
  325. package/dist/pregel/utils/config.cjs.map +0 -1
  326. package/dist/pregel/utils/config.d.cts +0 -36
  327. package/dist/pregel/utils/config.d.cts.map +0 -1
  328. package/dist/pregel/utils/config.d.ts +0 -36
  329. package/dist/pregel/utils/config.d.ts.map +0 -1
  330. package/dist/pregel/utils/config.js +0 -115
  331. package/dist/pregel/utils/config.js.map +0 -1
  332. package/dist/pregel/utils/index.cjs +0 -103
  333. package/dist/pregel/utils/index.cjs.map +0 -1
  334. package/dist/pregel/utils/index.d.cts +0 -51
  335. package/dist/pregel/utils/index.d.cts.map +0 -1
  336. package/dist/pregel/utils/index.d.ts +0 -51
  337. package/dist/pregel/utils/index.d.ts.map +0 -1
  338. package/dist/pregel/utils/index.js +0 -97
  339. package/dist/pregel/utils/index.js.map +0 -1
  340. package/dist/pregel/utils/subgraph.cjs +0 -19
  341. package/dist/pregel/utils/subgraph.cjs.map +0 -1
  342. package/dist/pregel/utils/subgraph.js +0 -17
  343. package/dist/pregel/utils/subgraph.js.map +0 -1
  344. package/dist/pregel/validate.cjs +0 -45
  345. package/dist/pregel/validate.cjs.map +0 -1
  346. package/dist/pregel/validate.js +0 -44
  347. package/dist/pregel/validate.js.map +0 -1
  348. package/dist/pregel/write.cjs +0 -97
  349. package/dist/pregel/write.cjs.map +0 -1
  350. package/dist/pregel/write.d.cts +0 -35
  351. package/dist/pregel/write.d.cts.map +0 -1
  352. package/dist/pregel/write.d.ts +0 -35
  353. package/dist/pregel/write.d.ts.map +0 -1
  354. package/dist/pregel/write.js +0 -95
  355. package/dist/pregel/write.js.map +0 -1
  356. package/dist/remote.cjs +0 -3
  357. package/dist/remote.d.cts +0 -2
  358. package/dist/remote.d.ts +0 -2
  359. package/dist/remote.js +0 -3
  360. package/dist/setup/async_local_storage.cjs +0 -12
  361. package/dist/setup/async_local_storage.cjs.map +0 -1
  362. package/dist/setup/async_local_storage.js +0 -11
  363. package/dist/setup/async_local_storage.js.map +0 -1
  364. package/dist/utils.cjs +0 -88
  365. package/dist/utils.cjs.map +0 -1
  366. package/dist/utils.d.cts +0 -32
  367. package/dist/utils.d.cts.map +0 -1
  368. package/dist/utils.d.ts +0 -32
  369. package/dist/utils.d.ts.map +0 -1
  370. package/dist/utils.js +0 -81
  371. package/dist/utils.js.map +0 -1
  372. package/dist/web.cjs +0 -96
  373. package/dist/web.d.cts +0 -23
  374. package/dist/web.d.ts +0 -23
  375. package/dist/web.js +0 -15
  376. package/dist/writer.cjs +0 -15
  377. package/dist/writer.cjs.map +0 -1
  378. package/dist/writer.d.cts +0 -7
  379. package/dist/writer.d.cts.map +0 -1
  380. package/dist/writer.d.ts +0 -7
  381. package/dist/writer.d.ts.map +0 -1
  382. package/dist/writer.js +0 -14
  383. package/dist/writer.js.map +0 -1
@@ -1,423 +0,0 @@
1
- const require_rolldown_runtime = require('../_virtual/rolldown_runtime.cjs');
2
- const require_errors = require('../errors.cjs');
3
- const require_constants = require('../constants.cjs');
4
- const require_utils = require('../utils.cjs');
5
- const require_write = require('../pregel/write.cjs');
6
- const require_read = require('../pregel/read.cjs');
7
- const require_subgraph = require('../pregel/utils/subgraph.cjs');
8
- const require_pregel_index = require('../pregel/index.cjs');
9
- const require_ephemeral_value = require('../channels/ephemeral_value.cjs');
10
- const __langchain_core_runnables = require_rolldown_runtime.__toESM(require("@langchain/core/runnables"));
11
- const __langchain_core_runnables_graph = require_rolldown_runtime.__toESM(require("@langchain/core/runnables/graph"));
12
- const zod_v4 = require_rolldown_runtime.__toESM(require("zod/v4"));
13
- const uuid = require_rolldown_runtime.__toESM(require("uuid"));
14
-
15
- //#region src/graph/graph.ts
16
- var Branch = class {
17
- path;
18
- ends;
19
- constructor(options) {
20
- if (__langchain_core_runnables.Runnable.isRunnable(options.path)) this.path = options.path;
21
- else this.path = (0, __langchain_core_runnables._coerceToRunnable)(options.path).withConfig({ runName: `Branch` });
22
- this.ends = Array.isArray(options.pathMap) ? options.pathMap.reduce((acc, n) => {
23
- acc[n] = n;
24
- return acc;
25
- }, {}) : options.pathMap;
26
- }
27
- run(writer, reader) {
28
- return require_write.ChannelWrite.registerWriter(new require_utils.RunnableCallable({
29
- name: "<branch_run>",
30
- trace: false,
31
- func: async (input, config) => {
32
- try {
33
- return await this._route(input, config, writer, reader);
34
- } catch (e) {
35
- if (e.name === require_errors.NodeInterrupt.unminifiable_name) console.warn("[WARN]: 'NodeInterrupt' thrown in conditional edge. This is likely a bug in your graph implementation.\nNodeInterrupt should only be thrown inside a node, not in edge conditions.");
36
- throw e;
37
- }
38
- }
39
- }));
40
- }
41
- async _route(input, config, writer, reader) {
42
- let result = await this.path.invoke(reader ? reader(config) : input, config);
43
- if (!Array.isArray(result)) result = [result];
44
- let destinations;
45
- if (this.ends) destinations = result.map((r) => require_constants._isSend(r) ? r : this.ends[r]);
46
- else destinations = result;
47
- if (destinations.some((dest) => !dest)) throw new Error("Branch condition returned unknown or null destination");
48
- if (destinations.filter(require_constants._isSend).some((packet) => packet.node === require_constants.END)) throw new require_errors.InvalidUpdateError("Cannot send a packet to the END node");
49
- const writeResult = await writer(destinations, config);
50
- return writeResult ?? input;
51
- }
52
- };
53
- var Graph = class {
54
- nodes;
55
- edges;
56
- branches;
57
- entryPoint;
58
- compiled = false;
59
- constructor() {
60
- this.nodes = {};
61
- this.edges = /* @__PURE__ */ new Set();
62
- this.branches = {};
63
- }
64
- warnIfCompiled(message) {
65
- if (this.compiled) console.warn(message);
66
- }
67
- get allEdges() {
68
- return this.edges;
69
- }
70
- addNode(...args) {
71
- function isMutlipleNodes(args$1) {
72
- return args$1.length >= 1 && typeof args$1[0] !== "string";
73
- }
74
- const nodes = isMutlipleNodes(args) ? Array.isArray(args[0]) ? args[0] : Object.entries(args[0]) : [[
75
- args[0],
76
- args[1],
77
- args[2]
78
- ]];
79
- if (nodes.length === 0) throw new Error("No nodes provided in `addNode`");
80
- for (const [key, action, options] of nodes) {
81
- for (const reservedChar of [require_constants.CHECKPOINT_NAMESPACE_SEPARATOR, require_constants.CHECKPOINT_NAMESPACE_END]) if (key.includes(reservedChar)) throw new Error(`"${reservedChar}" is a reserved character and is not allowed in node names.`);
82
- this.warnIfCompiled(`Adding a node to a graph that has already been compiled. This will not be reflected in the compiled graph.`);
83
- if (key in this.nodes) throw new Error(`Node \`${key}\` already present.`);
84
- if (key === require_constants.END) throw new Error(`Node \`${key}\` is reserved.`);
85
- const runnable = (0, __langchain_core_runnables._coerceToRunnable)(action);
86
- this.nodes[key] = {
87
- runnable,
88
- metadata: options?.metadata,
89
- subgraphs: require_subgraph.isPregelLike(runnable) ? [runnable] : options?.subgraphs,
90
- ends: options?.ends
91
- };
92
- }
93
- return this;
94
- }
95
- addEdge(startKey, endKey) {
96
- this.warnIfCompiled(`Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.`);
97
- if (startKey === require_constants.END) throw new Error("END cannot be a start node");
98
- if (endKey === require_constants.START) throw new Error("START cannot be an end node");
99
- if (Array.from(this.edges).some(([start]) => start === startKey) && !("channels" in this)) throw new Error(`Already found path for ${startKey}. For multiple edges, use StateGraph.`);
100
- this.edges.add([startKey, endKey]);
101
- return this;
102
- }
103
- addConditionalEdges(source, path, pathMap) {
104
- const options = typeof source === "object" ? source : {
105
- source,
106
- path,
107
- pathMap
108
- };
109
- this.warnIfCompiled("Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.");
110
- if (!__langchain_core_runnables.Runnable.isRunnable(options.path)) {
111
- const pathDisplayValues = Array.isArray(options.pathMap) ? options.pathMap.join(",") : Object.keys(options.pathMap ?? {}).join(",");
112
- options.path = (0, __langchain_core_runnables._coerceToRunnable)(options.path).withConfig({ runName: `Branch<${options.source}${pathDisplayValues !== "" ? `,${pathDisplayValues}` : ""}>`.slice(0, 63) });
113
- }
114
- const name = options.path.getName() === "RunnableLambda" ? "condition" : options.path.getName();
115
- if (this.branches[options.source] && this.branches[options.source][name]) throw new Error(`Condition \`${name}\` already present for node \`${source}\``);
116
- this.branches[options.source] ??= {};
117
- this.branches[options.source][name] = new Branch(options);
118
- return this;
119
- }
120
- /**
121
- * @deprecated use `addEdge(START, key)` instead
122
- */
123
- setEntryPoint(key) {
124
- this.warnIfCompiled("Setting the entry point of a graph that has already been compiled. This will not be reflected in the compiled graph.");
125
- return this.addEdge(require_constants.START, key);
126
- }
127
- /**
128
- * @deprecated use `addEdge(key, END)` instead
129
- */
130
- setFinishPoint(key) {
131
- this.warnIfCompiled("Setting a finish point of a graph that has already been compiled. This will not be reflected in the compiled graph.");
132
- return this.addEdge(key, require_constants.END);
133
- }
134
- compile({ checkpointer, interruptBefore, interruptAfter, name } = {}) {
135
- this.validate([...Array.isArray(interruptBefore) ? interruptBefore : [], ...Array.isArray(interruptAfter) ? interruptAfter : []]);
136
- const compiled = new CompiledGraph({
137
- builder: this,
138
- checkpointer,
139
- interruptAfter,
140
- interruptBefore,
141
- autoValidate: false,
142
- nodes: {},
143
- channels: {
144
- [require_constants.START]: new require_ephemeral_value.EphemeralValue(),
145
- [require_constants.END]: new require_ephemeral_value.EphemeralValue()
146
- },
147
- inputChannels: require_constants.START,
148
- outputChannels: require_constants.END,
149
- streamChannels: [],
150
- streamMode: "values",
151
- name
152
- });
153
- for (const [key, node] of Object.entries(this.nodes)) compiled.attachNode(key, node);
154
- for (const [start, end] of this.edges) compiled.attachEdge(start, end);
155
- for (const [start, branches] of Object.entries(this.branches)) for (const [name$1, branch] of Object.entries(branches)) compiled.attachBranch(start, name$1, branch);
156
- return compiled.validate();
157
- }
158
- validate(interrupt) {
159
- const allSources = new Set([...this.allEdges].map(([src, _]) => src));
160
- for (const [start] of Object.entries(this.branches)) allSources.add(start);
161
- for (const source of allSources) if (source !== require_constants.START && !(source in this.nodes)) throw new Error(`Found edge starting at unknown node \`${source}\``);
162
- const allTargets = new Set([...this.allEdges].map(([_, target]) => target));
163
- for (const [start, branches] of Object.entries(this.branches)) for (const branch of Object.values(branches)) if (branch.ends != null) for (const end of Object.values(branch.ends)) allTargets.add(end);
164
- else {
165
- allTargets.add(require_constants.END);
166
- for (const node of Object.keys(this.nodes)) if (node !== start) allTargets.add(node);
167
- }
168
- for (const node of Object.values(this.nodes)) for (const target of node.ends ?? []) allTargets.add(target);
169
- for (const node of Object.keys(this.nodes)) if (!allTargets.has(node)) throw new require_errors.UnreachableNodeError([
170
- `Node \`${node}\` is not reachable.`,
171
- "",
172
- "If you are returning Command objects from your node,",
173
- "make sure you are passing names of potential destination nodes as an \"ends\" array",
174
- "into \".addNode(..., { ends: [\"node1\", \"node2\"] })\"."
175
- ].join("\n"), { lc_error_code: "UNREACHABLE_NODE" });
176
- for (const target of allTargets) if (target !== require_constants.END && !(target in this.nodes)) throw new Error(`Found edge ending at unknown node \`${target}\``);
177
- if (interrupt) {
178
- for (const node of interrupt) if (!(node in this.nodes)) throw new Error(`Interrupt node \`${node}\` is not present`);
179
- }
180
- this.compiled = true;
181
- }
182
- };
183
- var CompiledGraph = class extends require_pregel_index.Pregel {
184
- builder;
185
- constructor({ builder,...rest }) {
186
- super(rest);
187
- this.builder = builder;
188
- }
189
- attachNode(key, node) {
190
- this.channels[key] = new require_ephemeral_value.EphemeralValue();
191
- this.nodes[key] = new require_read.PregelNode({
192
- channels: [],
193
- triggers: [],
194
- metadata: node.metadata,
195
- subgraphs: node.subgraphs,
196
- ends: node.ends
197
- }).pipe(node.runnable).pipe(new require_write.ChannelWrite([{
198
- channel: key,
199
- value: require_write.PASSTHROUGH
200
- }], [require_constants.TAG_HIDDEN]));
201
- this.streamChannels.push(key);
202
- }
203
- attachEdge(start, end) {
204
- if (end === require_constants.END) {
205
- if (start === require_constants.START) throw new Error("Cannot have an edge from START to END");
206
- this.nodes[start].writers.push(new require_write.ChannelWrite([{
207
- channel: require_constants.END,
208
- value: require_write.PASSTHROUGH
209
- }], [require_constants.TAG_HIDDEN]));
210
- } else {
211
- this.nodes[end].triggers.push(start);
212
- this.nodes[end].channels.push(start);
213
- }
214
- }
215
- attachBranch(start, name, branch) {
216
- if (start === require_constants.START && !this.nodes[require_constants.START]) this.nodes[require_constants.START] = require_pregel_index.Channel.subscribeTo(require_constants.START, { tags: [require_constants.TAG_HIDDEN] });
217
- this.nodes[start].pipe(branch.run((dests) => {
218
- const writes = dests.map((dest) => {
219
- if (require_constants._isSend(dest)) return dest;
220
- return {
221
- channel: dest === require_constants.END ? require_constants.END : `branch:${start}:${name}:${dest}`,
222
- value: require_write.PASSTHROUGH
223
- };
224
- });
225
- return new require_write.ChannelWrite(writes, [require_constants.TAG_HIDDEN]);
226
- }));
227
- const ends = branch.ends ? Object.values(branch.ends) : Object.keys(this.nodes);
228
- for (const end of ends) if (end !== require_constants.END) {
229
- const channelName = `branch:${start}:${name}:${end}`;
230
- this.channels[channelName] = new require_ephemeral_value.EphemeralValue();
231
- this.nodes[end].triggers.push(channelName);
232
- this.nodes[end].channels.push(channelName);
233
- }
234
- }
235
- /**
236
- * Returns a drawable representation of the computation graph.
237
- */
238
- async getGraphAsync(config) {
239
- const xray = config?.xray;
240
- const graph = new __langchain_core_runnables_graph.Graph();
241
- const startNodes = { [require_constants.START]: graph.addNode({ schema: zod_v4.z.any() }, require_constants.START) };
242
- const endNodes = {};
243
- let subgraphs = {};
244
- if (xray) subgraphs = Object.fromEntries((await require_utils.gatherIterator(this.getSubgraphsAsync())).filter((x) => isCompiledGraph(x[1])));
245
- function addEdge(start, end, label, conditional = false) {
246
- if (end === require_constants.END && endNodes[require_constants.END] === void 0) endNodes[require_constants.END] = graph.addNode({ schema: zod_v4.z.any() }, require_constants.END);
247
- if (startNodes[start] === void 0) return;
248
- if (endNodes[end] === void 0) throw new Error(`End node ${end} not found!`);
249
- return graph.addEdge(startNodes[start], endNodes[end], label !== end ? label : void 0, conditional);
250
- }
251
- for (const [key, nodeSpec] of Object.entries(this.builder.nodes)) {
252
- const displayKey = _escapeMermaidKeywords(key);
253
- const node = nodeSpec.runnable;
254
- const metadata = nodeSpec.metadata ?? {};
255
- if (this.interruptBefore?.includes(key) && this.interruptAfter?.includes(key)) metadata.__interrupt = "before,after";
256
- else if (this.interruptBefore?.includes(key)) metadata.__interrupt = "before";
257
- else if (this.interruptAfter?.includes(key)) metadata.__interrupt = "after";
258
- if (xray) {
259
- const newXrayValue = typeof xray === "number" ? xray - 1 : xray;
260
- const drawableSubgraph = subgraphs[key] !== void 0 ? await subgraphs[key].getGraphAsync({
261
- ...config,
262
- xray: newXrayValue
263
- }) : node.getGraph(config);
264
- drawableSubgraph.trimFirstNode();
265
- drawableSubgraph.trimLastNode();
266
- if (Object.keys(drawableSubgraph.nodes).length > 1) {
267
- const [e, s] = graph.extend(drawableSubgraph, displayKey);
268
- if (e === void 0) throw new Error(`Could not extend subgraph "${key}" due to missing entrypoint.`);
269
- function _isRunnableInterface(thing) {
270
- return thing ? thing.lc_runnable : false;
271
- }
272
- function _nodeDataStr(id, data) {
273
- if (id !== void 0 && !(0, uuid.validate)(id)) return id;
274
- else if (_isRunnableInterface(data)) try {
275
- let dataStr = data.getName();
276
- dataStr = dataStr.startsWith("Runnable") ? dataStr.slice(8) : dataStr;
277
- return dataStr;
278
- } catch (error) {
279
- return data.getName();
280
- }
281
- else return data.name ?? "UnknownSchema";
282
- }
283
- if (s !== void 0) startNodes[displayKey] = {
284
- name: _nodeDataStr(s.id, s.data),
285
- ...s
286
- };
287
- endNodes[displayKey] = {
288
- name: _nodeDataStr(e.id, e.data),
289
- ...e
290
- };
291
- } else {
292
- const newNode = graph.addNode(node, displayKey, metadata);
293
- startNodes[displayKey] = newNode;
294
- endNodes[displayKey] = newNode;
295
- }
296
- } else {
297
- const newNode = graph.addNode(node, displayKey, metadata);
298
- startNodes[displayKey] = newNode;
299
- endNodes[displayKey] = newNode;
300
- }
301
- }
302
- const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {
303
- if (a < b) return -1;
304
- else if (b > a) return 1;
305
- else return 0;
306
- });
307
- for (const [start, end] of sortedEdges) addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));
308
- for (const [start, branches] of Object.entries(this.builder.branches)) {
309
- const defaultEnds = {
310
- ...Object.fromEntries(Object.keys(this.builder.nodes).filter((k) => k !== start).map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])),
311
- [require_constants.END]: require_constants.END
312
- };
313
- for (const branch of Object.values(branches)) {
314
- let ends;
315
- if (branch.ends !== void 0) ends = branch.ends;
316
- else ends = defaultEnds;
317
- for (const [label, end] of Object.entries(ends)) addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end), label, true);
318
- }
319
- }
320
- for (const [key, node] of Object.entries(this.builder.nodes)) if (node.ends !== void 0) for (const end of node.ends) addEdge(_escapeMermaidKeywords(key), _escapeMermaidKeywords(end), void 0, true);
321
- return graph;
322
- }
323
- /**
324
- * Returns a drawable representation of the computation graph.
325
- *
326
- * @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.
327
- */
328
- getGraph(config) {
329
- const xray = config?.xray;
330
- const graph = new __langchain_core_runnables_graph.Graph();
331
- const startNodes = { [require_constants.START]: graph.addNode({ schema: zod_v4.z.any() }, require_constants.START) };
332
- const endNodes = {};
333
- let subgraphs = {};
334
- if (xray) subgraphs = Object.fromEntries(require_utils.gatherIteratorSync(this.getSubgraphs()).filter((x) => isCompiledGraph(x[1])));
335
- function addEdge(start, end, label, conditional = false) {
336
- if (end === require_constants.END && endNodes[require_constants.END] === void 0) endNodes[require_constants.END] = graph.addNode({ schema: zod_v4.z.any() }, require_constants.END);
337
- return graph.addEdge(startNodes[start], endNodes[end], label !== end ? label : void 0, conditional);
338
- }
339
- for (const [key, nodeSpec] of Object.entries(this.builder.nodes)) {
340
- const displayKey = _escapeMermaidKeywords(key);
341
- const node = nodeSpec.runnable;
342
- const metadata = nodeSpec.metadata ?? {};
343
- if (this.interruptBefore?.includes(key) && this.interruptAfter?.includes(key)) metadata.__interrupt = "before,after";
344
- else if (this.interruptBefore?.includes(key)) metadata.__interrupt = "before";
345
- else if (this.interruptAfter?.includes(key)) metadata.__interrupt = "after";
346
- if (xray) {
347
- const newXrayValue = typeof xray === "number" ? xray - 1 : xray;
348
- const drawableSubgraph = subgraphs[key] !== void 0 ? subgraphs[key].getGraph({
349
- ...config,
350
- xray: newXrayValue
351
- }) : node.getGraph(config);
352
- drawableSubgraph.trimFirstNode();
353
- drawableSubgraph.trimLastNode();
354
- if (Object.keys(drawableSubgraph.nodes).length > 1) {
355
- const [e, s] = graph.extend(drawableSubgraph, displayKey);
356
- if (e === void 0) throw new Error(`Could not extend subgraph "${key}" due to missing entrypoint.`);
357
- function _isRunnableInterface(thing) {
358
- return thing ? thing.lc_runnable : false;
359
- }
360
- function _nodeDataStr(id, data) {
361
- if (id !== void 0 && !(0, uuid.validate)(id)) return id;
362
- else if (_isRunnableInterface(data)) try {
363
- let dataStr = data.getName();
364
- dataStr = dataStr.startsWith("Runnable") ? dataStr.slice(8) : dataStr;
365
- return dataStr;
366
- } catch (error) {
367
- return data.getName();
368
- }
369
- else return data.name ?? "UnknownSchema";
370
- }
371
- if (s !== void 0) startNodes[displayKey] = {
372
- name: _nodeDataStr(s.id, s.data),
373
- ...s
374
- };
375
- endNodes[displayKey] = {
376
- name: _nodeDataStr(e.id, e.data),
377
- ...e
378
- };
379
- } else {
380
- const newNode = graph.addNode(node, displayKey, metadata);
381
- startNodes[displayKey] = newNode;
382
- endNodes[displayKey] = newNode;
383
- }
384
- } else {
385
- const newNode = graph.addNode(node, displayKey, metadata);
386
- startNodes[displayKey] = newNode;
387
- endNodes[displayKey] = newNode;
388
- }
389
- }
390
- const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {
391
- if (a < b) return -1;
392
- else if (b > a) return 1;
393
- else return 0;
394
- });
395
- for (const [start, end] of sortedEdges) addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));
396
- for (const [start, branches] of Object.entries(this.builder.branches)) {
397
- const defaultEnds = {
398
- ...Object.fromEntries(Object.keys(this.builder.nodes).filter((k) => k !== start).map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])),
399
- [require_constants.END]: require_constants.END
400
- };
401
- for (const branch of Object.values(branches)) {
402
- let ends;
403
- if (branch.ends !== void 0) ends = branch.ends;
404
- else ends = defaultEnds;
405
- for (const [label, end] of Object.entries(ends)) addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end), label, true);
406
- }
407
- }
408
- return graph;
409
- }
410
- };
411
- function isCompiledGraph(x) {
412
- return typeof x.attachNode === "function" && typeof x.attachEdge === "function";
413
- }
414
- function _escapeMermaidKeywords(key) {
415
- if (key === "subgraph") return `"${key}"`;
416
- return key;
417
- }
418
-
419
- //#endregion
420
- exports.Branch = Branch;
421
- exports.CompiledGraph = CompiledGraph;
422
- exports.Graph = Graph;
423
- //# sourceMappingURL=graph.cjs.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"graph.cjs","names":["Runnable","ChannelWrite","RunnableCallable","e: any","NodeInterrupt","destinations: (string | Send)[]","_isSend","END","InvalidUpdateError","args","CHECKPOINT_NAMESPACE_SEPARATOR","CHECKPOINT_NAMESPACE_END","isPregelLike","START","options: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >","EphemeralValue","name","UnreachableNodeError","Pregel","PregelNode","PASSTHROUGH","TAG_HIDDEN","Channel","DrawableGraph","startNodes: Record<string, DrawableGraphNode>","z","endNodes: Record<string, DrawableGraphNode>","subgraphs: Record<string, CompiledGraph<any>>","gatherIterator","defaultEnds: Record<string, string>","gatherIteratorSync"],"sources":["../../src/graph/graph.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-use-before-define */\nimport {\n _coerceToRunnable,\n Runnable,\n RunnableConfig,\n RunnableInterface,\n RunnableIOSchema,\n type RunnableLike as LangChainRunnableLike,\n} from \"@langchain/core/runnables\";\nimport {\n Node as DrawableGraphNode,\n Graph as DrawableGraph,\n} from \"@langchain/core/runnables/graph\";\nimport { All, BaseCheckpointSaver } from \"@langchain/langgraph-checkpoint\";\nimport { z } from \"zod/v4\";\nimport { validate as isUuid } from \"uuid\";\nimport type {\n RunnableLike,\n LangGraphRunnableConfig,\n} from \"../pregel/runnable_types.js\";\nimport { PregelNode } from \"../pregel/read.js\";\nimport { Channel, Pregel } from \"../pregel/index.js\";\nimport type { PregelParams } from \"../pregel/types.js\";\nimport { BaseChannel } from \"../channels/base.js\";\nimport { EphemeralValue } from \"../channels/ephemeral_value.js\";\nimport { ChannelWrite, PASSTHROUGH } from \"../pregel/write.js\";\nimport {\n _isSend,\n CHECKPOINT_NAMESPACE_END,\n CHECKPOINT_NAMESPACE_SEPARATOR,\n END,\n Send,\n START,\n TAG_HIDDEN,\n} from \"../constants.js\";\nimport {\n gatherIterator,\n gatherIteratorSync,\n RunnableCallable,\n} from \"../utils.js\";\nimport {\n InvalidUpdateError,\n NodeInterrupt,\n UnreachableNodeError,\n} from \"../errors.js\";\nimport { StateDefinition, StateType } from \"./annotation.js\";\nimport { isPregelLike } from \"../pregel/utils/subgraph.js\";\n\nexport interface BranchOptions<\n IO,\n N extends string,\n CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig\n> {\n source: N;\n path: RunnableLike<IO, BranchPathReturnValue, CallOptions>;\n pathMap?: Record<string, N | typeof END> | (N | typeof END)[];\n}\n\nexport type BranchPathReturnValue =\n | string\n | Send\n | (string | Send)[]\n | Promise<string | Send | (string | Send)[]>;\n\ntype NodeAction<S, U, C extends StateDefinition> = RunnableLike<\n S,\n U extends object ? U & Record<string, any> : U, // eslint-disable-line @typescript-eslint/no-explicit-any\n LangGraphRunnableConfig<StateType<C>>\n>;\n\nexport class Branch<\n IO,\n N extends string,\n CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig\n> {\n path: Runnable<IO, BranchPathReturnValue, CallOptions>;\n\n ends?: Record<string, N | typeof END>;\n\n constructor(options: Omit<BranchOptions<IO, N, CallOptions>, \"source\">) {\n if (Runnable.isRunnable(options.path)) {\n this.path = options.path as Runnable<\n IO,\n BranchPathReturnValue,\n CallOptions\n >;\n } else {\n this.path = _coerceToRunnable(\n options.path as LangChainRunnableLike<\n IO,\n BranchPathReturnValue,\n CallOptions\n >\n ).withConfig({ runName: `Branch` } as CallOptions);\n }\n this.ends = Array.isArray(options.pathMap)\n ? options.pathMap.reduce((acc, n) => {\n acc[n] = n;\n return acc;\n }, {} as Record<string, N | typeof END>)\n : options.pathMap;\n }\n\n run(\n writer: (\n dests: (string | Send)[],\n config: LangGraphRunnableConfig\n ) => Runnable | void | Promise<void>,\n reader?: (config: CallOptions) => IO\n ) {\n return ChannelWrite.registerWriter(\n new RunnableCallable({\n name: \"<branch_run>\",\n trace: false,\n func: async (input: IO, config: CallOptions) => {\n try {\n return await this._route(input, config, writer, reader);\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n } catch (e: any) {\n // Detect & warn if NodeInterrupt is thrown in a conditional edge\n if (e.name === NodeInterrupt.unminifiable_name) {\n console.warn(\n \"[WARN]: 'NodeInterrupt' thrown in conditional edge. This is likely a bug in your graph implementation.\\n\" +\n \"NodeInterrupt should only be thrown inside a node, not in edge conditions.\"\n );\n }\n throw e;\n }\n },\n })\n );\n }\n\n async _route(\n input: IO,\n config: CallOptions,\n writer: (\n dests: (string | Send)[],\n config: LangGraphRunnableConfig\n ) => Runnable | void | Promise<void>,\n reader?: (config: CallOptions) => IO\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n ): Promise<Runnable | any> {\n let result = await this.path.invoke(\n reader ? reader(config) : input,\n config\n );\n if (!Array.isArray(result)) {\n result = [result];\n }\n\n let destinations: (string | Send)[];\n if (this.ends) {\n destinations = result.map((r) => (_isSend(r) ? r : this.ends![r]));\n } else {\n destinations = result;\n }\n if (destinations.some((dest) => !dest)) {\n throw new Error(\"Branch condition returned unknown or null destination\");\n }\n if (destinations.filter(_isSend).some((packet) => packet.node === END)) {\n throw new InvalidUpdateError(\"Cannot send a packet to the END node\");\n }\n const writeResult = await writer(destinations, config);\n return writeResult ?? input;\n }\n}\n\nexport type NodeSpec<RunInput, RunOutput> = {\n runnable: Runnable<RunInput, RunOutput>;\n metadata?: Record<string, unknown>;\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n subgraphs?: Pregel<any, any>[];\n ends?: string[];\n defer?: boolean;\n};\n\nexport type AddNodeOptions<Nodes extends string = string> = {\n metadata?: Record<string, unknown>;\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n subgraphs?: Pregel<any, any>[];\n ends?: Nodes[];\n defer?: boolean;\n};\n\nexport class Graph<\n N extends string = typeof START | typeof END,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n RunInput = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n RunOutput = any,\n NodeSpecType extends NodeSpec<RunInput, RunOutput> = NodeSpec<\n RunInput,\n RunOutput\n >,\n C extends StateDefinition = StateDefinition\n> {\n nodes: Record<N, NodeSpecType>;\n\n edges: Set<[N | typeof START, N | typeof END]>;\n\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n branches: Record<string, Record<string, Branch<RunInput, N, any>>>;\n\n entryPoint?: string;\n\n compiled = false;\n\n constructor() {\n this.nodes = {} as Record<N, NodeSpecType>;\n this.edges = new Set();\n this.branches = {};\n }\n\n protected warnIfCompiled(message: string): void {\n if (this.compiled) {\n console.warn(message);\n }\n }\n\n get allEdges(): Set<[string, string]> {\n return this.edges;\n }\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n nodes:\n | Record<K, NodeAction<NodeInput, NodeOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ][]\n ): Graph<N | K, RunInput, RunOutput>;\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ): Graph<N | K, RunInput, RunOutput>;\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n ...args:\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ]\n | [\n nodes:\n | Record<K, NodeAction<NodeInput, NodeOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ][]\n ]\n ): Graph<N | K, RunInput, RunOutput> {\n function isMutlipleNodes(\n args: unknown[]\n ): args is [\n nodes:\n | Record<K, NodeAction<NodeInput, RunOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, RunOutput, C>,\n options?: AddNodeOptions\n ][],\n options?: AddNodeOptions\n ] {\n return args.length >= 1 && typeof args[0] !== \"string\";\n }\n\n const nodes = (\n isMutlipleNodes(args) // eslint-disable-line no-nested-ternary\n ? Array.isArray(args[0])\n ? args[0]\n : Object.entries(args[0])\n : [[args[0], args[1], args[2]]]\n ) as [K, NodeAction<NodeInput, RunOutput, C>, AddNodeOptions][];\n\n if (nodes.length === 0) {\n throw new Error(\"No nodes provided in `addNode`\");\n }\n\n for (const [key, action, options] of nodes) {\n for (const reservedChar of [\n CHECKPOINT_NAMESPACE_SEPARATOR,\n CHECKPOINT_NAMESPACE_END,\n ]) {\n if (key.includes(reservedChar)) {\n throw new Error(\n `\"${reservedChar}\" is a reserved character and is not allowed in node names.`\n );\n }\n }\n this.warnIfCompiled(\n `Adding a node to a graph that has already been compiled. This will not be reflected in the compiled graph.`\n );\n\n if (key in this.nodes) {\n throw new Error(`Node \\`${key}\\` already present.`);\n }\n if (key === END) {\n throw new Error(`Node \\`${key}\\` is reserved.`);\n }\n\n const runnable = _coerceToRunnable<RunInput, RunOutput>(\n // Account for arbitrary state due to Send API\n action as RunnableLike<RunInput, RunOutput>\n );\n\n this.nodes[key as unknown as N] = {\n runnable,\n metadata: options?.metadata,\n subgraphs: isPregelLike(runnable) ? [runnable] : options?.subgraphs,\n ends: options?.ends,\n } as NodeSpecType;\n }\n\n return this as Graph<N | K, RunInput, RunOutput, NodeSpecType>;\n }\n\n addEdge(startKey: N | typeof START, endKey: N | typeof END): this {\n this.warnIfCompiled(\n `Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.`\n );\n\n if (startKey === END) {\n throw new Error(\"END cannot be a start node\");\n }\n if (endKey === START) {\n throw new Error(\"START cannot be an end node\");\n }\n if (\n Array.from(this.edges).some(([start]) => start === startKey) &&\n !(\"channels\" in this)\n ) {\n throw new Error(\n `Already found path for ${startKey}. For multiple edges, use StateGraph.`\n );\n }\n\n this.edges.add([startKey, endKey]);\n\n return this;\n }\n\n addConditionalEdges(\n source: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>\n ): this;\n\n addConditionalEdges(\n source: N,\n path: RunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >,\n pathMap?: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >[\"pathMap\"]\n ): this;\n\n addConditionalEdges(\n source:\n | N\n | BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>,\n path?: RunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >,\n pathMap?: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >[\"pathMap\"]\n ): this {\n const options: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n > = typeof source === \"object\" ? source : { source, path: path!, pathMap };\n\n this.warnIfCompiled(\n \"Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n if (!Runnable.isRunnable(options.path)) {\n const pathDisplayValues = Array.isArray(options.pathMap)\n ? options.pathMap.join(\",\")\n : Object.keys(options.pathMap ?? {}).join(\",\");\n options.path = _coerceToRunnable(\n options.path as LangChainRunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >\n ).withConfig({\n runName: `Branch<${options.source}${\n pathDisplayValues !== \"\" ? `,${pathDisplayValues}` : \"\"\n }>`.slice(0, 63),\n });\n }\n // find a name for condition\n const name =\n options.path.getName() === \"RunnableLambda\"\n ? \"condition\"\n : options.path.getName();\n // validate condition\n if (this.branches[options.source] && this.branches[options.source][name]) {\n throw new Error(\n `Condition \\`${name}\\` already present for node \\`${source}\\``\n );\n }\n // save it\n this.branches[options.source] ??= {};\n this.branches[options.source][name] = new Branch(options);\n return this;\n }\n\n /**\n * @deprecated use `addEdge(START, key)` instead\n */\n setEntryPoint(key: N): this {\n this.warnIfCompiled(\n \"Setting the entry point of a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n\n return this.addEdge(START, key);\n }\n\n /**\n * @deprecated use `addEdge(key, END)` instead\n */\n setFinishPoint(key: N): this {\n this.warnIfCompiled(\n \"Setting a finish point of a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n\n return this.addEdge(key, END);\n }\n\n compile({\n checkpointer,\n interruptBefore,\n interruptAfter,\n name,\n }: {\n checkpointer?: BaseCheckpointSaver | false;\n interruptBefore?: N[] | All;\n interruptAfter?: N[] | All;\n name?: string;\n } = {}): CompiledGraph<N> {\n // validate the graph\n this.validate([\n ...(Array.isArray(interruptBefore) ? interruptBefore : []),\n ...(Array.isArray(interruptAfter) ? interruptAfter : []),\n ]);\n\n // create empty compiled graph\n const compiled = new CompiledGraph({\n builder: this,\n checkpointer,\n interruptAfter,\n interruptBefore,\n autoValidate: false,\n nodes: {} as Record<N | typeof START, PregelNode<RunInput, RunOutput>>,\n channels: {\n [START]: new EphemeralValue(),\n [END]: new EphemeralValue(),\n } as Record<N | typeof START | typeof END | string, BaseChannel>,\n inputChannels: START,\n outputChannels: END,\n streamChannels: [] as N[],\n streamMode: \"values\",\n name,\n });\n\n // attach nodes, edges and branches\n for (const [key, node] of Object.entries<NodeSpec<RunInput, RunOutput>>(\n this.nodes\n )) {\n compiled.attachNode(key as N, node);\n }\n for (const [start, end] of this.edges) {\n compiled.attachEdge(start, end);\n }\n for (const [start, branches] of Object.entries(this.branches)) {\n for (const [name, branch] of Object.entries(branches)) {\n compiled.attachBranch(start as N, name, branch);\n }\n }\n\n return compiled.validate();\n }\n\n validate(interrupt?: string[]): void {\n // assemble sources\n const allSources = new Set([...this.allEdges].map(([src, _]) => src));\n for (const [start] of Object.entries(this.branches)) {\n allSources.add(start);\n }\n\n // validate sources\n for (const source of allSources) {\n if (source !== START && !(source in this.nodes)) {\n throw new Error(`Found edge starting at unknown node \\`${source}\\``);\n }\n }\n\n // assemble targets\n const allTargets = new Set([...this.allEdges].map(([_, target]) => target));\n for (const [start, branches] of Object.entries(this.branches)) {\n for (const branch of Object.values(branches)) {\n if (branch.ends != null) {\n for (const end of Object.values(branch.ends)) {\n allTargets.add(end);\n }\n } else {\n allTargets.add(END);\n for (const node of Object.keys(this.nodes)) {\n if (node !== start) {\n allTargets.add(node);\n }\n }\n }\n }\n }\n for (const node of Object.values<NodeSpecType>(this.nodes)) {\n for (const target of node.ends ?? []) {\n allTargets.add(target);\n }\n }\n // validate targets\n for (const node of Object.keys(this.nodes)) {\n if (!allTargets.has(node)) {\n throw new UnreachableNodeError(\n [\n `Node \\`${node}\\` is not reachable.`,\n \"\",\n \"If you are returning Command objects from your node,\",\n 'make sure you are passing names of potential destination nodes as an \"ends\" array',\n 'into \".addNode(..., { ends: [\"node1\", \"node2\"] })\".',\n ].join(\"\\n\"),\n {\n lc_error_code: \"UNREACHABLE_NODE\",\n }\n );\n }\n }\n for (const target of allTargets) {\n if (target !== END && !(target in this.nodes)) {\n throw new Error(`Found edge ending at unknown node \\`${target}\\``);\n }\n }\n\n // validate interrupts\n if (interrupt) {\n for (const node of interrupt) {\n if (!(node in this.nodes)) {\n throw new Error(`Interrupt node \\`${node}\\` is not present`);\n }\n }\n }\n\n this.compiled = true;\n }\n}\n\nexport class CompiledGraph<\n N extends string,\n State = any, // eslint-disable-line @typescript-eslint/no-explicit-any\n Update = any, // eslint-disable-line @typescript-eslint/no-explicit-any\n ContextType extends Record<string, any> = Record<string, any>, // eslint-disable-line @typescript-eslint/no-explicit-any\n InputType = any, // eslint-disable-line @typescript-eslint/no-explicit-any\n OutputType = any, // eslint-disable-line @typescript-eslint/no-explicit-any\n NodeReturnType = unknown,\n CommandType = unknown,\n StreamCustomType = any // eslint-disable-line @typescript-eslint/no-explicit-any\n> extends Pregel<\n Record<N | typeof START, PregelNode<State, Update>>,\n Record<N | typeof START | typeof END | string, BaseChannel>,\n ContextType & Record<string, any>, // eslint-disable-line @typescript-eslint/no-explicit-any\n InputType,\n OutputType,\n InputType,\n OutputType,\n NodeReturnType,\n CommandType,\n StreamCustomType\n> {\n declare \"~NodeType\": N;\n\n declare \"~NodeReturnType\": NodeReturnType;\n\n declare \"~RunInput\": Update;\n\n declare \"~RunOutput\": State;\n\n builder: Graph<N, State, Update>;\n\n constructor({\n builder,\n ...rest\n }: { builder: Graph<N, State, Update> } & PregelParams<\n Record<N | typeof START, PregelNode<State, Update>>,\n Record<N | typeof START | typeof END | string, BaseChannel>\n >) {\n super(rest);\n this.builder = builder;\n }\n\n attachNode(key: N, node: NodeSpec<State, Update>): void {\n this.channels[key] = new EphemeralValue();\n this.nodes[key] = new PregelNode({\n channels: [],\n triggers: [],\n metadata: node.metadata,\n subgraphs: node.subgraphs,\n ends: node.ends,\n })\n .pipe(node.runnable)\n .pipe(\n new ChannelWrite([{ channel: key, value: PASSTHROUGH }], [TAG_HIDDEN])\n );\n (this.streamChannels as N[]).push(key);\n }\n\n attachEdge(start: N | typeof START, end: N | typeof END): void {\n if (end === END) {\n if (start === START) {\n throw new Error(\"Cannot have an edge from START to END\");\n }\n this.nodes[start].writers.push(\n new ChannelWrite([{ channel: END, value: PASSTHROUGH }], [TAG_HIDDEN])\n );\n } else {\n this.nodes[end].triggers.push(start);\n (this.nodes[end].channels as string[]).push(start);\n }\n }\n\n attachBranch(\n start: N | typeof START,\n name: string,\n branch: Branch<State, N>\n ) {\n // add hidden start node\n if (start === START && !this.nodes[START]) {\n this.nodes[START] = Channel.subscribeTo(START, { tags: [TAG_HIDDEN] });\n }\n\n // attach branch writer\n this.nodes[start].pipe(\n branch.run((dests) => {\n const writes = dests.map((dest) => {\n if (_isSend(dest)) {\n return dest;\n }\n return {\n channel: dest === END ? END : `branch:${start}:${name}:${dest}`,\n value: PASSTHROUGH,\n };\n });\n return new ChannelWrite(writes, [TAG_HIDDEN]);\n })\n );\n\n // attach branch readers\n const ends = branch.ends\n ? Object.values(branch.ends)\n : (Object.keys(this.nodes) as N[]);\n for (const end of ends) {\n if (end !== END) {\n const channelName = `branch:${start}:${name}:${end}`;\n (this.channels as Record<string, BaseChannel>)[channelName] =\n new EphemeralValue();\n this.nodes[end].triggers.push(channelName);\n (this.nodes[end].channels as string[]).push(channelName);\n }\n }\n }\n\n /**\n * Returns a drawable representation of the computation graph.\n */\n override async getGraphAsync(\n config?: RunnableConfig & { xray?: boolean | number }\n ): Promise<DrawableGraph> {\n const xray = config?.xray;\n const graph = new DrawableGraph();\n const startNodes: Record<string, DrawableGraphNode> = {\n [START]: graph.addNode({ schema: z.any() }, START),\n };\n const endNodes: Record<string, DrawableGraphNode> = {};\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n let subgraphs: Record<string, CompiledGraph<any>> = {};\n if (xray) {\n subgraphs = Object.fromEntries(\n (await gatherIterator(this.getSubgraphsAsync())).filter(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n (x): x is [string, CompiledGraph<any>] => isCompiledGraph(x[1])\n )\n );\n }\n\n function addEdge(\n start: string,\n end: string,\n label?: string,\n conditional = false\n ) {\n if (end === END && endNodes[END] === undefined) {\n endNodes[END] = graph.addNode({ schema: z.any() }, END);\n }\n if (startNodes[start] === undefined) {\n return;\n }\n if (endNodes[end] === undefined) {\n throw new Error(`End node ${end} not found!`);\n }\n return graph.addEdge(\n startNodes[start],\n endNodes[end],\n label !== end ? label : undefined,\n conditional\n );\n }\n\n for (const [key, nodeSpec] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n const displayKey = _escapeMermaidKeywords(key);\n const node = nodeSpec.runnable;\n const metadata = nodeSpec.metadata ?? {};\n if (\n this.interruptBefore?.includes(key) &&\n this.interruptAfter?.includes(key)\n ) {\n metadata.__interrupt = \"before,after\";\n } else if (this.interruptBefore?.includes(key)) {\n metadata.__interrupt = \"before\";\n } else if (this.interruptAfter?.includes(key)) {\n metadata.__interrupt = \"after\";\n }\n if (xray) {\n const newXrayValue = typeof xray === \"number\" ? xray - 1 : xray;\n const drawableSubgraph =\n subgraphs[key] !== undefined\n ? await subgraphs[key].getGraphAsync({\n ...config,\n xray: newXrayValue,\n })\n : node.getGraph(config);\n\n drawableSubgraph.trimFirstNode();\n drawableSubgraph.trimLastNode();\n\n if (Object.keys(drawableSubgraph.nodes).length > 1) {\n const [e, s] = graph.extend(drawableSubgraph, displayKey);\n if (e === undefined) {\n throw new Error(\n `Could not extend subgraph \"${key}\" due to missing entrypoint.`\n );\n }\n\n // TODO: Remove default name once we stop supporting core 0.2.0\n // eslint-disable-next-line no-inner-declarations\n function _isRunnableInterface(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n thing: any\n ): thing is RunnableInterface {\n return thing ? thing.lc_runnable : false;\n }\n // eslint-disable-next-line no-inner-declarations\n function _nodeDataStr(\n id: string | undefined,\n data: RunnableInterface | RunnableIOSchema\n ): string {\n if (id !== undefined && !isUuid(id)) {\n return id;\n } else if (_isRunnableInterface(data)) {\n try {\n let dataStr = data.getName();\n dataStr = dataStr.startsWith(\"Runnable\")\n ? dataStr.slice(\"Runnable\".length)\n : dataStr;\n return dataStr;\n } catch (error) {\n return data.getName();\n }\n } else {\n return data.name ?? \"UnknownSchema\";\n }\n }\n // TODO: Remove casts when we stop supporting core 0.2.0\n if (s !== undefined) {\n startNodes[displayKey] = {\n name: _nodeDataStr(s.id, s.data),\n ...s,\n } as DrawableGraphNode;\n }\n endNodes[displayKey] = {\n name: _nodeDataStr(e.id, e.data),\n ...e,\n } as DrawableGraphNode;\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n }\n const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {\n if (a < b) {\n return -1;\n } else if (b > a) {\n return 1;\n } else {\n return 0;\n }\n });\n for (const [start, end] of sortedEdges) {\n addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));\n }\n for (const [start, branches] of Object.entries(this.builder.branches)) {\n const defaultEnds: Record<string, string> = {\n ...Object.fromEntries(\n Object.keys(this.builder.nodes)\n .filter((k) => k !== start)\n .map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])\n ),\n [END]: END,\n };\n for (const branch of Object.values(branches)) {\n let ends;\n if (branch.ends !== undefined) {\n ends = branch.ends;\n } else {\n ends = defaultEnds;\n }\n for (const [label, end] of Object.entries(ends)) {\n addEdge(\n _escapeMermaidKeywords(start),\n _escapeMermaidKeywords(end),\n label,\n true\n );\n }\n }\n }\n for (const [key, node] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n if (node.ends !== undefined) {\n for (const end of node.ends) {\n addEdge(\n _escapeMermaidKeywords(key),\n _escapeMermaidKeywords(end),\n undefined,\n true\n );\n }\n }\n }\n return graph;\n }\n\n /**\n * Returns a drawable representation of the computation graph.\n *\n * @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.\n */\n override getGraph(\n config?: RunnableConfig & { xray?: boolean | number }\n ): DrawableGraph {\n const xray = config?.xray;\n const graph = new DrawableGraph();\n const startNodes: Record<string, DrawableGraphNode> = {\n [START]: graph.addNode(\n {\n schema: z.any(),\n },\n START\n ),\n };\n const endNodes: Record<string, DrawableGraphNode> = {};\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n let subgraphs: Record<string, CompiledGraph<any>> = {};\n if (xray) {\n subgraphs = Object.fromEntries(\n gatherIteratorSync(this.getSubgraphs()).filter(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n (x): x is [string, CompiledGraph<any>] => isCompiledGraph(x[1])\n )\n );\n }\n\n function addEdge(\n start: string,\n end: string,\n label?: string,\n conditional = false\n ) {\n if (end === END && endNodes[END] === undefined) {\n endNodes[END] = graph.addNode({ schema: z.any() }, END);\n }\n return graph.addEdge(\n startNodes[start],\n endNodes[end],\n label !== end ? label : undefined,\n conditional\n );\n }\n\n for (const [key, nodeSpec] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n const displayKey = _escapeMermaidKeywords(key);\n const node = nodeSpec.runnable;\n const metadata = nodeSpec.metadata ?? {};\n if (\n this.interruptBefore?.includes(key) &&\n this.interruptAfter?.includes(key)\n ) {\n metadata.__interrupt = \"before,after\";\n } else if (this.interruptBefore?.includes(key)) {\n metadata.__interrupt = \"before\";\n } else if (this.interruptAfter?.includes(key)) {\n metadata.__interrupt = \"after\";\n }\n if (xray) {\n const newXrayValue = typeof xray === \"number\" ? xray - 1 : xray;\n const drawableSubgraph =\n subgraphs[key] !== undefined\n ? subgraphs[key].getGraph({\n ...config,\n xray: newXrayValue,\n })\n : node.getGraph(config);\n drawableSubgraph.trimFirstNode();\n drawableSubgraph.trimLastNode();\n if (Object.keys(drawableSubgraph.nodes).length > 1) {\n const [e, s] = graph.extend(drawableSubgraph, displayKey);\n if (e === undefined) {\n throw new Error(\n `Could not extend subgraph \"${key}\" due to missing entrypoint.`\n );\n }\n\n // TODO: Remove default name once we stop supporting core 0.2.0\n // eslint-disable-next-line no-inner-declarations\n function _isRunnableInterface(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n thing: any\n ): thing is RunnableInterface {\n return thing ? thing.lc_runnable : false;\n }\n // eslint-disable-next-line no-inner-declarations\n function _nodeDataStr(\n id: string | undefined,\n data: RunnableInterface | RunnableIOSchema\n ): string {\n if (id !== undefined && !isUuid(id)) {\n return id;\n } else if (_isRunnableInterface(data)) {\n try {\n let dataStr = data.getName();\n dataStr = dataStr.startsWith(\"Runnable\")\n ? dataStr.slice(\"Runnable\".length)\n : dataStr;\n return dataStr;\n } catch (error) {\n return data.getName();\n }\n } else {\n return data.name ?? \"UnknownSchema\";\n }\n }\n // TODO: Remove casts when we stop supporting core 0.2.0\n if (s !== undefined) {\n startNodes[displayKey] = {\n name: _nodeDataStr(s.id, s.data),\n ...s,\n } as DrawableGraphNode;\n }\n endNodes[displayKey] = {\n name: _nodeDataStr(e.id, e.data),\n ...e,\n } as DrawableGraphNode;\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n }\n const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {\n if (a < b) {\n return -1;\n } else if (b > a) {\n return 1;\n } else {\n return 0;\n }\n });\n for (const [start, end] of sortedEdges) {\n addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));\n }\n for (const [start, branches] of Object.entries(this.builder.branches)) {\n const defaultEnds: Record<string, string> = {\n ...Object.fromEntries(\n Object.keys(this.builder.nodes)\n .filter((k) => k !== start)\n .map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])\n ),\n [END]: END,\n };\n for (const branch of Object.values(branches)) {\n let ends;\n if (branch.ends !== undefined) {\n ends = branch.ends;\n } else {\n ends = defaultEnds;\n }\n for (const [label, end] of Object.entries(ends)) {\n addEdge(\n _escapeMermaidKeywords(start),\n _escapeMermaidKeywords(end),\n label,\n true\n );\n }\n }\n }\n return graph;\n }\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction isCompiledGraph(x: unknown): x is CompiledGraph<any> {\n return (\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n typeof (x as CompiledGraph<any>).attachNode === \"function\" &&\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n typeof (x as CompiledGraph<any>).attachEdge === \"function\"\n );\n}\n\nfunction _escapeMermaidKeywords(key: string) {\n if (key === \"subgraph\") {\n return `\"${key}\"`;\n }\n return key;\n}\n"],"mappings":";;;;;;;;;;;;;;;AAsEA,IAAa,SAAb,MAIE;CACA;CAEA;CAEA,YAAY,SAA4D;AACtE,MAAIA,oCAAS,WAAW,QAAQ,MAC9B,MAAK,OAAO,QAAQ;MAMpB,MAAK,yDACH,QAAQ,MAKR,WAAW,EAAE,SAAS;AAE1B,OAAK,OAAO,MAAM,QAAQ,QAAQ,WAC9B,QAAQ,QAAQ,QAAQ,KAAK,MAAM;AACjC,OAAI,KAAK;AACT,UAAO;KACN,MACH,QAAQ;;CAGd,IACE,QAIA,QACA;AACA,SAAOC,2BAAa,eAClB,IAAIC,+BAAiB;GACnB,MAAM;GACN,OAAO;GACP,MAAM,OAAO,OAAW,WAAwB;AAC9C,QAAI;AACF,YAAO,MAAM,KAAK,OAAO,OAAO,QAAQ,QAAQ;aAEzCC,GAAQ;AAEf,SAAI,EAAE,SAASC,6BAAc,kBAC3B,SAAQ,KACN;AAIJ,WAAM;;;;;CAOhB,MAAM,OACJ,OACA,QACA,QAIA,QAEyB;EACzB,IAAI,SAAS,MAAM,KAAK,KAAK,OAC3B,SAAS,OAAO,UAAU,OAC1B;AAEF,MAAI,CAAC,MAAM,QAAQ,QACjB,UAAS,CAAC;EAGZ,IAAIC;AACJ,MAAI,KAAK,KACP,gBAAe,OAAO,KAAK,MAAOC,0BAAQ,KAAK,IAAI,KAAK,KAAM;MAE9D,gBAAe;AAEjB,MAAI,aAAa,MAAM,SAAS,CAAC,MAC/B,OAAM,IAAI,MAAM;AAElB,MAAI,aAAa,OAAOA,2BAAS,MAAM,WAAW,OAAO,SAASC,uBAChE,OAAM,IAAIC,kCAAmB;EAE/B,MAAM,cAAc,MAAM,OAAO,cAAc;AAC/C,SAAO,eAAe;;;AAqB1B,IAAa,QAAb,MAWE;CACA;CAEA;CAGA;CAEA;CAEA,WAAW;CAEX,cAAc;AACZ,OAAK,QAAQ;AACb,OAAK,wBAAQ,IAAI;AACjB,OAAK,WAAW;;CAGlB,AAAU,eAAe,SAAuB;AAC9C,MAAI,KAAK,SACP,SAAQ,KAAK;;CAIjB,IAAI,WAAkC;AACpC,SAAO,KAAK;;CAmBd,QACE,GAAG,MAegC;EACnC,SAAS,gBACP,QAUA;AACA,UAAOC,OAAK,UAAU,KAAK,OAAOA,OAAK,OAAO;;EAGhD,MAAM,QACJ,gBAAgB,QACZ,MAAM,QAAQ,KAAK,MACjB,KAAK,KACL,OAAO,QAAQ,KAAK,MACtB,CAAC;GAAC,KAAK;GAAI,KAAK;GAAI,KAAK;;AAG/B,MAAI,MAAM,WAAW,EACnB,OAAM,IAAI,MAAM;AAGlB,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY,OAAO;AAC1C,QAAK,MAAM,gBAAgB,CACzBC,kDACAC,4CAEA,KAAI,IAAI,SAAS,cACf,OAAM,IAAI,MACR,IAAI,aAAa;AAIvB,QAAK,eACH;AAGF,OAAI,OAAO,KAAK,MACd,OAAM,IAAI,MAAM,UAAU,IAAI;AAEhC,OAAI,QAAQJ,sBACV,OAAM,IAAI,MAAM,UAAU,IAAI;GAGhC,MAAM,6DAEJ;AAGF,QAAK,MAAM,OAAuB;IAChC;IACA,UAAU,SAAS;IACnB,WAAWK,8BAAa,YAAY,CAAC,YAAY,SAAS;IAC1D,MAAM,SAAS;;;AAInB,SAAO;;CAGT,QAAQ,UAA4B,QAA8B;AAChE,OAAK,eACH;AAGF,MAAI,aAAaL,sBACf,OAAM,IAAI,MAAM;AAElB,MAAI,WAAWM,wBACb,OAAM,IAAI,MAAM;AAElB,MACE,MAAM,KAAK,KAAK,OAAO,MAAM,CAAC,WAAW,UAAU,aACnD,EAAE,cAAc,MAEhB,OAAM,IAAI,MACR,0BAA0B,SAAS;AAIvC,OAAK,MAAM,IAAI,CAAC,UAAU;AAE1B,SAAO;;CAqBT,oBACE,QAGA,MAKA,SAKM;EACN,MAAMC,UAIF,OAAO,WAAW,WAAW,SAAS;GAAE;GAAc;GAAO;;AAEjE,OAAK,eACH;AAEF,MAAI,CAACd,oCAAS,WAAW,QAAQ,OAAO;GACtC,MAAM,oBAAoB,MAAM,QAAQ,QAAQ,WAC5C,QAAQ,QAAQ,KAAK,OACrB,OAAO,KAAK,QAAQ,WAAW,IAAI,KAAK;AAC5C,WAAQ,yDACN,QAAQ,MAKR,WAAW,EACX,SAAS,UAAU,QAAQ,SACzB,sBAAsB,KAAK,IAAI,sBAAsB,GACtD,GAAG,MAAM,GAAG;;EAIjB,MAAM,OACJ,QAAQ,KAAK,cAAc,mBACvB,cACA,QAAQ,KAAK;AAEnB,MAAI,KAAK,SAAS,QAAQ,WAAW,KAAK,SAAS,QAAQ,QAAQ,MACjE,OAAM,IAAI,MACR,eAAe,KAAK,gCAAgC,OAAO;AAI/D,OAAK,SAAS,QAAQ,YAAY;AAClC,OAAK,SAAS,QAAQ,QAAQ,QAAQ,IAAI,OAAO;AACjD,SAAO;;;;;CAMT,cAAc,KAAc;AAC1B,OAAK,eACH;AAGF,SAAO,KAAK,QAAQa,yBAAO;;;;;CAM7B,eAAe,KAAc;AAC3B,OAAK,eACH;AAGF,SAAO,KAAK,QAAQ,KAAKN;;CAG3B,QAAQ,EACN,cACA,iBACA,gBACA,SAME,IAAsB;AAExB,OAAK,SAAS,CACZ,GAAI,MAAM,QAAQ,mBAAmB,kBAAkB,IACvD,GAAI,MAAM,QAAQ,kBAAkB,iBAAiB;EAIvD,MAAM,WAAW,IAAI,cAAc;GACjC,SAAS;GACT;GACA;GACA;GACA,cAAc;GACd,OAAO;GACP,UAAU;KACPM,0BAAQ,IAAIE;KACZR,wBAAM,IAAIQ;;GAEb,eAAeF;GACf,gBAAgBN;GAChB,gBAAgB;GAChB,YAAY;GACZ;;AAIF,OAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAC/B,KAAK,OAEL,UAAS,WAAW,KAAU;AAEhC,OAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,MAC9B,UAAS,WAAW,OAAO;AAE7B,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,UAClD,MAAK,MAAM,CAACS,QAAM,WAAW,OAAO,QAAQ,UAC1C,UAAS,aAAa,OAAYA,QAAM;AAI5C,SAAO,SAAS;;CAGlB,SAAS,WAA4B;EAEnC,MAAM,aAAa,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,KAAK,CAAC,KAAK,OAAO;AAChE,OAAK,MAAM,CAAC,UAAU,OAAO,QAAQ,KAAK,UACxC,YAAW,IAAI;AAIjB,OAAK,MAAM,UAAU,WACnB,KAAI,WAAWH,2BAAS,EAAE,UAAU,KAAK,OACvC,OAAM,IAAI,MAAM,yCAAyC,OAAO;EAKpE,MAAM,aAAa,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,KAAK,CAAC,GAAG,YAAY;AACnE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,UAClD,MAAK,MAAM,UAAU,OAAO,OAAO,UACjC,KAAI,OAAO,QAAQ,KACjB,MAAK,MAAM,OAAO,OAAO,OAAO,OAAO,MACrC,YAAW,IAAI;OAEZ;AACL,cAAW,IAAIN;AACf,QAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,OAClC,KAAI,SAAS,MACX,YAAW,IAAI;;AAMzB,OAAK,MAAM,QAAQ,OAAO,OAAqB,KAAK,OAClD,MAAK,MAAM,UAAU,KAAK,QAAQ,GAChC,YAAW,IAAI;AAInB,OAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,OAClC,KAAI,CAAC,WAAW,IAAI,MAClB,OAAM,IAAIU,oCACR;GACE,UAAU,KAAK;GACf;GACA;GACA;GACA;IACA,KAAK,OACP,EACE,eAAe;AAKvB,OAAK,MAAM,UAAU,WACnB,KAAI,WAAWV,yBAAO,EAAE,UAAU,KAAK,OACrC,OAAM,IAAI,MAAM,uCAAuC,OAAO;AAKlE,MAAI,WACF;QAAK,MAAM,QAAQ,UACjB,KAAI,EAAE,QAAQ,KAAK,OACjB,OAAM,IAAI,MAAM,oBAAoB,KAAK;;AAK/C,OAAK,WAAW;;;AAIpB,IAAa,gBAAb,cAUUW,4BAWR;CASA;CAEA,YAAY,EACV,QACA,GAAG,QAIF;AACD,QAAM;AACN,OAAK,UAAU;;CAGjB,WAAW,KAAQ,MAAqC;AACtD,OAAK,SAAS,OAAO,IAAIH;AACzB,OAAK,MAAM,OAAO,IAAII,wBAAW;GAC/B,UAAU;GACV,UAAU;GACV,UAAU,KAAK;GACf,WAAW,KAAK;GAChB,MAAM,KAAK;KAEV,KAAK,KAAK,UACV,KACC,IAAIlB,2BAAa,CAAC;GAAE,SAAS;GAAK,OAAOmB;MAAgB,CAACC;AAE9D,EAAC,KAAK,eAAuB,KAAK;;CAGpC,WAAW,OAAyB,KAA2B;AAC7D,MAAI,QAAQd,uBAAK;AACf,OAAI,UAAUM,wBACZ,OAAM,IAAI,MAAM;AAElB,QAAK,MAAM,OAAO,QAAQ,KACxB,IAAIZ,2BAAa,CAAC;IAAE,SAASM;IAAK,OAAOa;OAAgB,CAACC;SAEvD;AACL,QAAK,MAAM,KAAK,SAAS,KAAK;AAC9B,GAAC,KAAK,MAAM,KAAK,SAAsB,KAAK;;;CAIhD,aACE,OACA,MACA,QACA;AAEA,MAAI,UAAUR,2BAAS,CAAC,KAAK,MAAMA,yBACjC,MAAK,MAAMA,2BAASS,6BAAQ,YAAYT,yBAAO,EAAE,MAAM,CAACQ;AAI1D,OAAK,MAAM,OAAO,KAChB,OAAO,KAAK,UAAU;GACpB,MAAM,SAAS,MAAM,KAAK,SAAS;AACjC,QAAIf,0BAAQ,MACV,QAAO;AAET,WAAO;KACL,SAAS,SAASC,wBAAMA,wBAAM,UAAU,MAAM,GAAG,KAAK,GAAG;KACzD,OAAOa;;;AAGX,UAAO,IAAInB,2BAAa,QAAQ,CAACoB;;EAKrC,MAAM,OAAO,OAAO,OAChB,OAAO,OAAO,OAAO,QACpB,OAAO,KAAK,KAAK;AACtB,OAAK,MAAM,OAAO,KAChB,KAAI,QAAQd,uBAAK;GACf,MAAM,cAAc,UAAU,MAAM,GAAG,KAAK,GAAG;AAC/C,GAAC,KAAK,SAAyC,eAC7C,IAAIQ;AACN,QAAK,MAAM,KAAK,SAAS,KAAK;AAC9B,GAAC,KAAK,MAAM,KAAK,SAAsB,KAAK;;;;;;CAQlD,MAAe,cACb,QACwB;EACxB,MAAM,OAAO,QAAQ;EACrB,MAAM,QAAQ,IAAIQ;EAClB,MAAMC,aAAgD,GACnDX,0BAAQ,MAAM,QAAQ,EAAE,QAAQY,SAAE,SAASZ;EAE9C,MAAMa,WAA8C;EAEpD,IAAIC,YAAgD;AACpD,MAAI,KACF,aAAY,OAAO,aAChB,MAAMC,6BAAe,KAAK,sBAAsB,QAE9C,MAAyC,gBAAgB,EAAE;EAKlE,SAAS,QACP,OACA,KACA,OACA,cAAc,OACd;AACA,OAAI,QAAQrB,yBAAO,SAASA,2BAAS,OACnC,UAASA,yBAAO,MAAM,QAAQ,EAAE,QAAQkB,SAAE,SAASlB;AAErD,OAAI,WAAW,WAAW,OACxB;AAEF,OAAI,SAAS,SAAS,OACpB,OAAM,IAAI,MAAM,YAAY,IAAI;AAElC,UAAO,MAAM,QACX,WAAW,QACX,SAAS,MACT,UAAU,MAAM,QAAQ,QACxB;;AAIJ,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,KAAK,QAAQ,QAGrD;GACH,MAAM,aAAa,uBAAuB;GAC1C,MAAM,OAAO,SAAS;GACtB,MAAM,WAAW,SAAS,YAAY;AACtC,OACE,KAAK,iBAAiB,SAAS,QAC/B,KAAK,gBAAgB,SAAS,KAE9B,UAAS,cAAc;YACd,KAAK,iBAAiB,SAAS,KACxC,UAAS,cAAc;YACd,KAAK,gBAAgB,SAAS,KACvC,UAAS,cAAc;AAEzB,OAAI,MAAM;IACR,MAAM,eAAe,OAAO,SAAS,WAAW,OAAO,IAAI;IAC3D,MAAM,mBACJ,UAAU,SAAS,SACf,MAAM,UAAU,KAAK,cAAc;KACjC,GAAG;KACH,MAAM;SAER,KAAK,SAAS;AAEpB,qBAAiB;AACjB,qBAAiB;AAEjB,QAAI,OAAO,KAAK,iBAAiB,OAAO,SAAS,GAAG;KAClD,MAAM,CAAC,GAAG,KAAK,MAAM,OAAO,kBAAkB;AAC9C,SAAI,MAAM,OACR,OAAM,IAAI,MACR,8BAA8B,IAAI;KAMtC,SAAS,qBAEP,OAC4B;AAC5B,aAAO,QAAQ,MAAM,cAAc;;KAGrC,SAAS,aACP,IACA,MACQ;AACR,UAAI,OAAO,UAAa,oBAAQ,IAC9B,QAAO;eACE,qBAAqB,MAC9B,KAAI;OACF,IAAI,UAAU,KAAK;AACnB,iBAAU,QAAQ,WAAW,cACzB,QAAQ,MAAM,KACd;AACJ,cAAO;eACA,OAAO;AACd,cAAO,KAAK;;UAGd,QAAO,KAAK,QAAQ;;AAIxB,SAAI,MAAM,OACR,YAAW,cAAc;MACvB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;AAGP,cAAS,cAAc;MACrB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;WAEA;KAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,gBAAW,cAAc;AACzB,cAAS,cAAc;;UAEpB;IAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,eAAW,cAAc;AACzB,aAAS,cAAc;;;EAG3B,MAAM,cAAc,CAAC,GAAG,KAAK,QAAQ,UAAU,MAAM,CAAC,IAAI,CAAC,OAAO;AAChE,OAAI,IAAI,EACN,QAAO;YACE,IAAI,EACb,QAAO;OAEP,QAAO;;AAGX,OAAK,MAAM,CAAC,OAAO,QAAQ,YACzB,SAAQ,uBAAuB,QAAQ,uBAAuB;AAEhE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,QAAQ,WAAW;GACrE,MAAMsB,cAAsC;IAC1C,GAAG,OAAO,YACR,OAAO,KAAK,KAAK,QAAQ,OACtB,QAAQ,MAAM,MAAM,OACpB,KAAK,MAAM,CAAC,uBAAuB,IAAI,uBAAuB;KAElEtB,wBAAMA;;AAET,QAAK,MAAM,UAAU,OAAO,OAAO,WAAW;IAC5C,IAAI;AACJ,QAAI,OAAO,SAAS,OAClB,QAAO,OAAO;QAEd,QAAO;AAET,SAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,MACxC,SACE,uBAAuB,QACvB,uBAAuB,MACvB,OACA;;;AAKR,OAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,QAAQ,OAIpD,KAAI,KAAK,SAAS,OAChB,MAAK,MAAM,OAAO,KAAK,KACrB,SACE,uBAAuB,MACvB,uBAAuB,MACvB,QACA;AAKR,SAAO;;;;;;;CAQT,AAAS,SACP,QACe;EACf,MAAM,OAAO,QAAQ;EACrB,MAAM,QAAQ,IAAIgB;EAClB,MAAMC,aAAgD,GACnDX,0BAAQ,MAAM,QACb,EACE,QAAQY,SAAE,SAEZZ;EAGJ,MAAMa,WAA8C;EAEpD,IAAIC,YAAgD;AACpD,MAAI,KACF,aAAY,OAAO,YACjBG,iCAAmB,KAAK,gBAAgB,QAErC,MAAyC,gBAAgB,EAAE;EAKlE,SAAS,QACP,OACA,KACA,OACA,cAAc,OACd;AACA,OAAI,QAAQvB,yBAAO,SAASA,2BAAS,OACnC,UAASA,yBAAO,MAAM,QAAQ,EAAE,QAAQkB,SAAE,SAASlB;AAErD,UAAO,MAAM,QACX,WAAW,QACX,SAAS,MACT,UAAU,MAAM,QAAQ,QACxB;;AAIJ,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,KAAK,QAAQ,QAGrD;GACH,MAAM,aAAa,uBAAuB;GAC1C,MAAM,OAAO,SAAS;GACtB,MAAM,WAAW,SAAS,YAAY;AACtC,OACE,KAAK,iBAAiB,SAAS,QAC/B,KAAK,gBAAgB,SAAS,KAE9B,UAAS,cAAc;YACd,KAAK,iBAAiB,SAAS,KACxC,UAAS,cAAc;YACd,KAAK,gBAAgB,SAAS,KACvC,UAAS,cAAc;AAEzB,OAAI,MAAM;IACR,MAAM,eAAe,OAAO,SAAS,WAAW,OAAO,IAAI;IAC3D,MAAM,mBACJ,UAAU,SAAS,SACf,UAAU,KAAK,SAAS;KACtB,GAAG;KACH,MAAM;SAER,KAAK,SAAS;AACpB,qBAAiB;AACjB,qBAAiB;AACjB,QAAI,OAAO,KAAK,iBAAiB,OAAO,SAAS,GAAG;KAClD,MAAM,CAAC,GAAG,KAAK,MAAM,OAAO,kBAAkB;AAC9C,SAAI,MAAM,OACR,OAAM,IAAI,MACR,8BAA8B,IAAI;KAMtC,SAAS,qBAEP,OAC4B;AAC5B,aAAO,QAAQ,MAAM,cAAc;;KAGrC,SAAS,aACP,IACA,MACQ;AACR,UAAI,OAAO,UAAa,oBAAQ,IAC9B,QAAO;eACE,qBAAqB,MAC9B,KAAI;OACF,IAAI,UAAU,KAAK;AACnB,iBAAU,QAAQ,WAAW,cACzB,QAAQ,MAAM,KACd;AACJ,cAAO;eACA,OAAO;AACd,cAAO,KAAK;;UAGd,QAAO,KAAK,QAAQ;;AAIxB,SAAI,MAAM,OACR,YAAW,cAAc;MACvB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;AAGP,cAAS,cAAc;MACrB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;WAEA;KAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,gBAAW,cAAc;AACzB,cAAS,cAAc;;UAEpB;IAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,eAAW,cAAc;AACzB,aAAS,cAAc;;;EAG3B,MAAM,cAAc,CAAC,GAAG,KAAK,QAAQ,UAAU,MAAM,CAAC,IAAI,CAAC,OAAO;AAChE,OAAI,IAAI,EACN,QAAO;YACE,IAAI,EACb,QAAO;OAEP,QAAO;;AAGX,OAAK,MAAM,CAAC,OAAO,QAAQ,YACzB,SAAQ,uBAAuB,QAAQ,uBAAuB;AAEhE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,QAAQ,WAAW;GACrE,MAAMsB,cAAsC;IAC1C,GAAG,OAAO,YACR,OAAO,KAAK,KAAK,QAAQ,OACtB,QAAQ,MAAM,MAAM,OACpB,KAAK,MAAM,CAAC,uBAAuB,IAAI,uBAAuB;KAElEtB,wBAAMA;;AAET,QAAK,MAAM,UAAU,OAAO,OAAO,WAAW;IAC5C,IAAI;AACJ,QAAI,OAAO,SAAS,OAClB,QAAO,OAAO;QAEd,QAAO;AAET,SAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,MACxC,SACE,uBAAuB,QACvB,uBAAuB,MACvB,OACA;;;AAKR,SAAO;;;AAKX,SAAS,gBAAgB,GAAqC;AAC5D,QAEE,OAAQ,EAAyB,eAAe,cAEhD,OAAQ,EAAyB,eAAe;;AAIpD,SAAS,uBAAuB,KAAa;AAC3C,KAAI,QAAQ,WACV,QAAO,IAAI,IAAI;AAEjB,QAAO"}
@@ -1,132 +0,0 @@
1
- import { BaseChannel } from "../channels/base.cjs";
2
- import { LangGraphRunnableConfig, RunnableLike as RunnableLike$1 } from "../pregel/runnable_types.cjs";
3
- import { StateDefinition, StateType } from "./annotation.cjs";
4
- import { RunnableCallable } from "../utils.cjs";
5
- import { PregelNode } from "../pregel/read.cjs";
6
- import { END, START, Send } from "../constants.cjs";
7
- import { PregelParams } from "../pregel/types.cjs";
8
- import { Pregel } from "../pregel/index.cjs";
9
- import { All, BaseCheckpointSaver } from "@langchain/langgraph-checkpoint";
10
- import { Runnable, RunnableConfig } from "@langchain/core/runnables";
11
- import { Graph } from "@langchain/core/runnables/graph";
12
-
13
- //#region src/graph/graph.d.ts
14
- interface BranchOptions<IO, N extends string, CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig> {
15
- source: N;
16
- path: RunnableLike$1<IO, BranchPathReturnValue, CallOptions>;
17
- pathMap?: Record<string, N | typeof END> | (N | typeof END)[];
18
- }
19
- type BranchPathReturnValue = string | Send | (string | Send)[] | Promise<string | Send | (string | Send)[]>;
20
- type NodeAction<S, U, C extends StateDefinition> = RunnableLike$1<S, U extends object ? U & Record<string, any> : U,
21
- // eslint-disable-line @typescript-eslint/no-explicit-any
22
- LangGraphRunnableConfig<StateType<C>>>;
23
- declare class Branch<IO, N extends string, CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig> {
24
- path: Runnable<IO, BranchPathReturnValue, CallOptions>;
25
- ends?: Record<string, N | typeof END>;
26
- constructor(options: Omit<BranchOptions<IO, N, CallOptions>, "source">);
27
- run(writer: (dests: (string | Send)[], config: LangGraphRunnableConfig) => Runnable | void | Promise<void>, reader?: (config: CallOptions) => IO): RunnableCallable<unknown, unknown>;
28
- _route(input: IO, config: CallOptions, writer: (dests: (string | Send)[], config: LangGraphRunnableConfig) => Runnable | void | Promise<void>, reader?: (config: CallOptions) => IO
29
- // eslint-disable-next-line @typescript-eslint/no-explicit-any
30
- ): Promise<Runnable | any>;
31
- }
32
- type NodeSpec<RunInput, RunOutput> = {
33
- runnable: Runnable<RunInput, RunOutput>;
34
- metadata?: Record<string, unknown>;
35
- // eslint-disable-next-line @typescript-eslint/no-explicit-any
36
- subgraphs?: Pregel<any, any>[];
37
- ends?: string[];
38
- defer?: boolean;
39
- };
40
- type AddNodeOptions<Nodes extends string = string> = {
41
- metadata?: Record<string, unknown>;
42
- // eslint-disable-next-line @typescript-eslint/no-explicit-any
43
- subgraphs?: Pregel<any, any>[];
44
- ends?: Nodes[];
45
- defer?: boolean;
46
- };
47
- declare class Graph$1<N extends string = typeof START | typeof END,
48
- // eslint-disable-next-line @typescript-eslint/no-explicit-any
49
- RunInput = any,
50
- // eslint-disable-next-line @typescript-eslint/no-explicit-any
51
- RunOutput = any, NodeSpecType extends NodeSpec<RunInput, RunOutput> = NodeSpec<RunInput, RunOutput>, C extends StateDefinition = StateDefinition> {
52
- nodes: Record<N, NodeSpecType>;
53
- edges: Set<[N | typeof START, N | typeof END]>;
54
- // eslint-disable-next-line @typescript-eslint/no-explicit-any
55
- branches: Record<string, Record<string, Branch<RunInput, N, any>>>;
56
- entryPoint?: string;
57
- compiled: boolean;
58
- constructor();
59
- protected warnIfCompiled(message: string): void;
60
- get allEdges(): Set<[string, string]>;
61
- addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(nodes: Record<K, NodeAction<NodeInput, NodeOutput, C>> | [key: K, action: NodeAction<NodeInput, NodeOutput, C>, options?: AddNodeOptions][]): Graph$1<N | K, RunInput, RunOutput>;
62
- addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(key: K, action: NodeAction<NodeInput, NodeOutput, C>, options?: AddNodeOptions): Graph$1<N | K, RunInput, RunOutput>;
63
- addEdge(startKey: N | typeof START, endKey: N | typeof END): this;
64
- addConditionalEdges(source: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>): this;
65
- addConditionalEdges(source: N, path: RunnableLike$1<RunInput, BranchPathReturnValue, LangGraphRunnableConfig<StateType<C>>>, pathMap?: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>["pathMap"]): this;
66
- /**
67
- * @deprecated use `addEdge(START, key)` instead
68
- */
69
- setEntryPoint(key: N): this;
70
- /**
71
- * @deprecated use `addEdge(key, END)` instead
72
- */
73
- setFinishPoint(key: N): this;
74
- compile({
75
- checkpointer,
76
- interruptBefore,
77
- interruptAfter,
78
- name
79
- }?: {
80
- checkpointer?: BaseCheckpointSaver | false;
81
- interruptBefore?: N[] | All;
82
- interruptAfter?: N[] | All;
83
- name?: string;
84
- }): CompiledGraph<N>;
85
- validate(interrupt?: string[]): void;
86
- }
87
- declare class CompiledGraph<N extends string, State = any,
88
- // eslint-disable-line @typescript-eslint/no-explicit-any
89
- Update = any,
90
- // eslint-disable-line @typescript-eslint/no-explicit-any
91
- ContextType extends Record<string, any> = Record<string, any>,
92
- // eslint-disable-line @typescript-eslint/no-explicit-any
93
- InputType = any,
94
- // eslint-disable-line @typescript-eslint/no-explicit-any
95
- OutputType = any,
96
- // eslint-disable-line @typescript-eslint/no-explicit-any
97
- NodeReturnType = unknown, CommandType = unknown, StreamCustomType = any // eslint-disable-line @typescript-eslint/no-explicit-any
98
- > extends Pregel<Record<N | typeof START, PregelNode<State, Update>>, Record<N | typeof START | typeof END | string, BaseChannel>, ContextType & Record<string, any>,
99
- // eslint-disable-line @typescript-eslint/no-explicit-any
100
- InputType, OutputType, InputType, OutputType, NodeReturnType, CommandType, StreamCustomType> {
101
- "~NodeType": N;
102
- "~NodeReturnType": NodeReturnType;
103
- "~RunInput": Update;
104
- "~RunOutput": State;
105
- builder: Graph$1<N, State, Update>;
106
- constructor({
107
- builder,
108
- ...rest
109
- }: {
110
- builder: Graph$1<N, State, Update>;
111
- } & PregelParams<Record<N | typeof START, PregelNode<State, Update>>, Record<N | typeof START | typeof END | string, BaseChannel>>);
112
- attachNode(key: N, node: NodeSpec<State, Update>): void;
113
- attachEdge(start: N | typeof START, end: N | typeof END): void;
114
- attachBranch(start: N | typeof START, name: string, branch: Branch<State, N>): void;
115
- /**
116
- * Returns a drawable representation of the computation graph.
117
- */
118
- getGraphAsync(config?: RunnableConfig & {
119
- xray?: boolean | number;
120
- }): Promise<Graph>;
121
- /**
122
- * Returns a drawable representation of the computation graph.
123
- *
124
- * @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.
125
- */
126
- getGraph(config?: RunnableConfig & {
127
- xray?: boolean | number;
128
- }): Graph;
129
- }
130
- //#endregion
131
- export { AddNodeOptions, Branch, CompiledGraph, Graph$1 as Graph, NodeSpec };
132
- //# sourceMappingURL=graph.d.cts.map