AI/dify
1
0
Fork 0
mirror of https://git.mirrors.martin98.com/https://github.com/langgenius/dify.git synced 2025-08-14 18:35:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix(workflow): loop check

Browse Source
This commit is contained in:
takatost 2024-08-28 21:47:47 +08:00
parent 790dd3b22f
commit ae22015fe7
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
api/core/workflow/graph_engine/entities/graph.py
View File

@ -282,15 +282,16 @@ class Graph(BaseModel):
""" """
Check whether it is connected to the previous node Check whether it is connected to the previous node
""" """
new_route = list(route) last_node_id = route[-1]
for graph_edge in edge_mapping.get(new_route[-1], []): for graph_edge in edge_mapping.get(last_node_id, []):
if not graph_edge.target_node_id: if not graph_edge.target_node_id:
continue continue
if graph_edge.target_node_id in new_route: if graph_edge.target_node_id in route:
raise ValueError(f"Node {graph_edge.source_node_id} is connected to the previous node, please check the graph.") raise ValueError(f"Node {graph_edge.source_node_id} is connected to the previous node, please check the graph.")
new_route = route[:]
new_route.append(graph_edge.target_node_id) new_route.append(graph_edge.target_node_id)
cls._check_connected_to_previous_node( cls._check_connected_to_previous_node(
route=new_route, route=new_route,