您最多选择25个主题 主题必须以字母或数字开头,可以包含连字符 (-),并且长度不得超过35个字符

workflow.ts 10KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329
  1. import {
  2. getConnectedEdges,
  3. getIncomers,
  4. getOutgoers,
  5. } from 'reactflow'
  6. import { v4 as uuid4 } from 'uuid'
  7. import {
  8. groupBy,
  9. isEqual,
  10. uniqBy,
  11. } from 'lodash-es'
  12. import type {
  13. Edge,
  14. Node,
  15. } from '../types'
  16. import {
  17. BlockEnum,
  18. } from '../types'
  19. import type { IterationNodeType } from '../nodes/iteration/types'
  20. import type { LoopNodeType } from '../nodes/loop/types'
  21. export const canRunBySingle = (nodeType: BlockEnum) => {
  22. return nodeType === BlockEnum.LLM
  23. || nodeType === BlockEnum.KnowledgeRetrieval
  24. || nodeType === BlockEnum.Code
  25. || nodeType === BlockEnum.TemplateTransform
  26. || nodeType === BlockEnum.QuestionClassifier
  27. || nodeType === BlockEnum.HttpRequest
  28. || nodeType === BlockEnum.Tool
  29. || nodeType === BlockEnum.ParameterExtractor
  30. || nodeType === BlockEnum.Iteration
  31. || nodeType === BlockEnum.Agent
  32. || nodeType === BlockEnum.DocExtractor
  33. || nodeType === BlockEnum.Loop
  34. }
  35. type ConnectedSourceOrTargetNodesChange = {
  36. type: string
  37. edge: Edge
  38. }[]
  39. export const getNodesConnectedSourceOrTargetHandleIdsMap = (changes: ConnectedSourceOrTargetNodesChange, nodes: Node[]) => {
  40. const nodesConnectedSourceOrTargetHandleIdsMap = {} as Record<string, any>
  41. changes.forEach((change) => {
  42. const {
  43. edge,
  44. type,
  45. } = change
  46. const sourceNode = nodes.find(node => node.id === edge.source)!
  47. if (sourceNode) {
  48. nodesConnectedSourceOrTargetHandleIdsMap[sourceNode.id] = nodesConnectedSourceOrTargetHandleIdsMap[sourceNode.id] || {
  49. _connectedSourceHandleIds: [...(sourceNode?.data._connectedSourceHandleIds || [])],
  50. _connectedTargetHandleIds: [...(sourceNode?.data._connectedTargetHandleIds || [])],
  51. }
  52. }
  53. const targetNode = nodes.find(node => node.id === edge.target)!
  54. if (targetNode) {
  55. nodesConnectedSourceOrTargetHandleIdsMap[targetNode.id] = nodesConnectedSourceOrTargetHandleIdsMap[targetNode.id] || {
  56. _connectedSourceHandleIds: [...(targetNode?.data._connectedSourceHandleIds || [])],
  57. _connectedTargetHandleIds: [...(targetNode?.data._connectedTargetHandleIds || [])],
  58. }
  59. }
  60. if (sourceNode) {
  61. if (type === 'remove') {
  62. const index = nodesConnectedSourceOrTargetHandleIdsMap[sourceNode.id]._connectedSourceHandleIds.findIndex((handleId: string) => handleId === edge.sourceHandle)
  63. nodesConnectedSourceOrTargetHandleIdsMap[sourceNode.id]._connectedSourceHandleIds.splice(index, 1)
  64. }
  65. if (type === 'add')
  66. nodesConnectedSourceOrTargetHandleIdsMap[sourceNode.id]._connectedSourceHandleIds.push(edge.sourceHandle || 'source')
  67. }
  68. if (targetNode) {
  69. if (type === 'remove') {
  70. const index = nodesConnectedSourceOrTargetHandleIdsMap[targetNode.id]._connectedTargetHandleIds.findIndex((handleId: string) => handleId === edge.targetHandle)
  71. nodesConnectedSourceOrTargetHandleIdsMap[targetNode.id]._connectedTargetHandleIds.splice(index, 1)
  72. }
  73. if (type === 'add')
  74. nodesConnectedSourceOrTargetHandleIdsMap[targetNode.id]._connectedTargetHandleIds.push(edge.targetHandle || 'target')
  75. }
  76. })
  77. return nodesConnectedSourceOrTargetHandleIdsMap
  78. }
  79. export const getValidTreeNodes = (nodes: Node[], edges: Edge[]) => {
  80. const startNode = nodes.find(node => node.data.type === BlockEnum.Start)
  81. if (!startNode) {
  82. return {
  83. validNodes: [],
  84. maxDepth: 0,
  85. }
  86. }
  87. const list: Node[] = [startNode]
  88. let maxDepth = 1
  89. const traverse = (root: Node, depth: number) => {
  90. if (depth > maxDepth)
  91. maxDepth = depth
  92. const outgoers = getOutgoers(root, nodes, edges)
  93. if (outgoers.length) {
  94. outgoers.forEach((outgoer) => {
  95. list.push(outgoer)
  96. if (outgoer.data.type === BlockEnum.Iteration)
  97. list.push(...nodes.filter(node => node.parentId === outgoer.id))
  98. if (outgoer.data.type === BlockEnum.Loop)
  99. list.push(...nodes.filter(node => node.parentId === outgoer.id))
  100. traverse(outgoer, depth + 1)
  101. })
  102. }
  103. else {
  104. list.push(root)
  105. if (root.data.type === BlockEnum.Iteration)
  106. list.push(...nodes.filter(node => node.parentId === root.id))
  107. if (root.data.type === BlockEnum.Loop)
  108. list.push(...nodes.filter(node => node.parentId === root.id))
  109. }
  110. }
  111. traverse(startNode, maxDepth)
  112. return {
  113. validNodes: uniqBy(list, 'id'),
  114. maxDepth,
  115. }
  116. }
  117. export const changeNodesAndEdgesId = (nodes: Node[], edges: Edge[]) => {
  118. const idMap = nodes.reduce((acc, node) => {
  119. acc[node.id] = uuid4()
  120. return acc
  121. }, {} as Record<string, string>)
  122. const newNodes = nodes.map((node) => {
  123. return {
  124. ...node,
  125. id: idMap[node.id],
  126. }
  127. })
  128. const newEdges = edges.map((edge) => {
  129. return {
  130. ...edge,
  131. source: idMap[edge.source],
  132. target: idMap[edge.target],
  133. }
  134. })
  135. return [newNodes, newEdges] as [Node[], Edge[]]
  136. }
  137. type ParallelInfoItem = {
  138. parallelNodeId: string
  139. depth: number
  140. isBranch?: boolean
  141. }
  142. type NodeParallelInfo = {
  143. parallelNodeId: string
  144. edgeHandleId: string
  145. depth: number
  146. }
  147. type NodeHandle = {
  148. node: Node
  149. handle: string
  150. }
  151. type NodeStreamInfo = {
  152. upstreamNodes: Set<string>
  153. downstreamEdges: Set<string>
  154. }
  155. export const getParallelInfo = (nodes: Node[], edges: Edge[], parentNodeId?: string) => {
  156. let startNode
  157. if (parentNodeId) {
  158. const parentNode = nodes.find(node => node.id === parentNodeId)
  159. if (!parentNode)
  160. throw new Error('Parent node not found')
  161. startNode = nodes.find(node => node.id === (parentNode.data as (IterationNodeType | LoopNodeType)).start_node_id)
  162. }
  163. else {
  164. startNode = nodes.find(node => node.data.type === BlockEnum.Start)
  165. }
  166. if (!startNode)
  167. throw new Error('Start node not found')
  168. const parallelList = [] as ParallelInfoItem[]
  169. const nextNodeHandles = [{ node: startNode, handle: 'source' }]
  170. let hasAbnormalEdges = false
  171. const traverse = (firstNodeHandle: NodeHandle) => {
  172. const nodeEdgesSet = {} as Record<string, Set<string>>
  173. const totalEdgesSet = new Set<string>()
  174. const nextHandles = [firstNodeHandle]
  175. const streamInfo = {} as Record<string, NodeStreamInfo>
  176. const parallelListItem = {
  177. parallelNodeId: '',
  178. depth: 0,
  179. } as ParallelInfoItem
  180. const nodeParallelInfoMap = {} as Record<string, NodeParallelInfo>
  181. nodeParallelInfoMap[firstNodeHandle.node.id] = {
  182. parallelNodeId: '',
  183. edgeHandleId: '',
  184. depth: 0,
  185. }
  186. while (nextHandles.length) {
  187. const currentNodeHandle = nextHandles.shift()!
  188. const { node: currentNode, handle: currentHandle = 'source' } = currentNodeHandle
  189. const currentNodeHandleKey = currentNode.id
  190. const connectedEdges = edges.filter(edge => edge.source === currentNode.id && edge.sourceHandle === currentHandle)
  191. const connectedEdgesLength = connectedEdges.length
  192. const outgoers = nodes.filter(node => connectedEdges.some(edge => edge.target === node.id))
  193. const incomers = getIncomers(currentNode, nodes, edges)
  194. if (!streamInfo[currentNodeHandleKey]) {
  195. streamInfo[currentNodeHandleKey] = {
  196. upstreamNodes: new Set<string>(),
  197. downstreamEdges: new Set<string>(),
  198. }
  199. }
  200. if (nodeEdgesSet[currentNodeHandleKey]?.size > 0 && incomers.length > 1) {
  201. const newSet = new Set<string>()
  202. for (const item of totalEdgesSet) {
  203. if (!streamInfo[currentNodeHandleKey].downstreamEdges.has(item))
  204. newSet.add(item)
  205. }
  206. if (isEqual(nodeEdgesSet[currentNodeHandleKey], newSet)) {
  207. parallelListItem.depth = nodeParallelInfoMap[currentNode.id].depth
  208. nextNodeHandles.push({ node: currentNode, handle: currentHandle })
  209. break
  210. }
  211. }
  212. if (nodeParallelInfoMap[currentNode.id].depth > parallelListItem.depth)
  213. parallelListItem.depth = nodeParallelInfoMap[currentNode.id].depth
  214. outgoers.forEach((outgoer) => {
  215. const outgoerConnectedEdges = getConnectedEdges([outgoer], edges).filter(edge => edge.source === outgoer.id)
  216. const sourceEdgesGroup = groupBy(outgoerConnectedEdges, 'sourceHandle')
  217. const incomers = getIncomers(outgoer, nodes, edges)
  218. if (outgoers.length > 1 && incomers.length > 1)
  219. hasAbnormalEdges = true
  220. Object.keys(sourceEdgesGroup).forEach((sourceHandle) => {
  221. nextHandles.push({ node: outgoer, handle: sourceHandle })
  222. })
  223. if (!outgoerConnectedEdges.length)
  224. nextHandles.push({ node: outgoer, handle: 'source' })
  225. const outgoerKey = outgoer.id
  226. if (!nodeEdgesSet[outgoerKey])
  227. nodeEdgesSet[outgoerKey] = new Set<string>()
  228. if (nodeEdgesSet[currentNodeHandleKey]) {
  229. for (const item of nodeEdgesSet[currentNodeHandleKey])
  230. nodeEdgesSet[outgoerKey].add(item)
  231. }
  232. if (!streamInfo[outgoerKey]) {
  233. streamInfo[outgoerKey] = {
  234. upstreamNodes: new Set<string>(),
  235. downstreamEdges: new Set<string>(),
  236. }
  237. }
  238. if (!nodeParallelInfoMap[outgoer.id]) {
  239. nodeParallelInfoMap[outgoer.id] = {
  240. ...nodeParallelInfoMap[currentNode.id],
  241. }
  242. }
  243. if (connectedEdgesLength > 1) {
  244. const edge = connectedEdges.find(edge => edge.target === outgoer.id)!
  245. nodeEdgesSet[outgoerKey].add(edge.id)
  246. totalEdgesSet.add(edge.id)
  247. streamInfo[currentNodeHandleKey].downstreamEdges.add(edge.id)
  248. streamInfo[outgoerKey].upstreamNodes.add(currentNodeHandleKey)
  249. for (const item of streamInfo[currentNodeHandleKey].upstreamNodes)
  250. streamInfo[item].downstreamEdges.add(edge.id)
  251. if (!parallelListItem.parallelNodeId)
  252. parallelListItem.parallelNodeId = currentNode.id
  253. const prevDepth = nodeParallelInfoMap[currentNode.id].depth + 1
  254. const currentDepth = nodeParallelInfoMap[outgoer.id].depth
  255. nodeParallelInfoMap[outgoer.id].depth = Math.max(prevDepth, currentDepth)
  256. }
  257. else {
  258. for (const item of streamInfo[currentNodeHandleKey].upstreamNodes)
  259. streamInfo[outgoerKey].upstreamNodes.add(item)
  260. nodeParallelInfoMap[outgoer.id].depth = nodeParallelInfoMap[currentNode.id].depth
  261. }
  262. })
  263. }
  264. parallelList.push(parallelListItem)
  265. }
  266. while (nextNodeHandles.length) {
  267. const nodeHandle = nextNodeHandles.shift()!
  268. traverse(nodeHandle)
  269. }
  270. return {
  271. parallelList,
  272. hasAbnormalEdges,
  273. }
  274. }
  275. export const hasErrorHandleNode = (nodeType?: BlockEnum) => {
  276. return nodeType === BlockEnum.LLM || nodeType === BlockEnum.Tool || nodeType === BlockEnum.HttpRequest || nodeType === BlockEnum.Code
  277. }