We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b70fe26 commit be30528Copy full SHA for be30528
pydantic_graph/pydantic_graph/beta/graph_builder.py
@@ -329,8 +329,8 @@ def _handle_path(p: Path):
329
pass
330
331
def _handle_destination_node(d: AnyDestinationNode):
332
- if id(d) in destination_ids: # pragma: no cover
333
- return # prevent infinite recursion if there is a cycle of decisions; not sure if this is possible
+ if id(d) in destination_ids:
+ return # prevent infinite recursion if there is a cycle of decisions
334
335
destination_ids.add(id(d))
336
destinations.append(d)
0 commit comments