forked from strands-agents/sdk-python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgraph.py
More file actions
1244 lines (1033 loc) · 51.4 KB
/
graph.py
File metadata and controls
1244 lines (1033 loc) · 51.4 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
"""Directed Graph Multi-Agent Pattern Implementation.
This module provides a deterministic graph-based agent orchestration system where
agents or MultiAgentBase instances (like Swarm or Graph) are nodes in a graph,
executed according to edge dependencies, with output from one node passed as input
to connected nodes.
Key Features:
- Agents and MultiAgentBase instances (Swarm, Graph, etc.) as graph nodes
- Deterministic execution based on dependency resolution
- Output propagation along edges
- Support for cyclic graphs (feedback loops)
- Clear dependency management
- Supports nested graphs (Graph as a node in another Graph)
"""
import asyncio
import copy
import logging
import time
from collections.abc import AsyncIterator, Callable, Mapping
from dataclasses import dataclass, field
from typing import Any, cast
from opentelemetry import trace as trace_api
from .._async import run_async
from ..agent import Agent
from ..agent.state import AgentState
from ..hooks.events import (
AfterMultiAgentInvocationEvent,
AfterNodeCallEvent,
BeforeMultiAgentInvocationEvent,
BeforeNodeCallEvent,
MultiAgentInitializedEvent,
)
from ..hooks.registry import HookProvider, HookRegistry
from ..interrupt import Interrupt, _InterruptState
from ..session import SessionManager
from ..telemetry import get_tracer
from ..types._events import (
MultiAgentHandoffEvent,
MultiAgentNodeCancelEvent,
MultiAgentNodeInterruptEvent,
MultiAgentNodeStartEvent,
MultiAgentNodeStopEvent,
MultiAgentNodeStreamEvent,
MultiAgentResultEvent,
)
from ..types.content import ContentBlock, Messages
from ..types.event_loop import Metrics, Usage
from ..types.multiagent import MultiAgentInput
from ..types.traces import AttributeValue
from .base import MultiAgentBase, MultiAgentResult, NodeResult, Status
logger = logging.getLogger(__name__)
_DEFAULT_GRAPH_ID = "default_graph"
@dataclass
class GraphState:
"""Graph execution state.
Attributes:
status: Current execution status of the graph.
completed_nodes: Set of nodes that have completed execution.
failed_nodes: Set of nodes that failed during execution.
interrupted_nodes: Set of nodes that user interrupted during execution.
execution_order: List of nodes in the order they were executed.
task: The original input prompt/query provided to the graph execution.
This represents the actual work to be performed by the graph as a whole.
Entry point nodes receive this task as their input if they have no dependencies.
start_time: Timestamp when the current invocation started.
Resets on each invocation, even when resuming from interrupt.
execution_time: Execution time of current invocation in milliseconds.
Excludes time spent waiting for interrupt responses.
"""
# Task (with default empty string)
task: MultiAgentInput = ""
# Execution state
status: Status = Status.PENDING
completed_nodes: set["GraphNode"] = field(default_factory=set)
failed_nodes: set["GraphNode"] = field(default_factory=set)
interrupted_nodes: set["GraphNode"] = field(default_factory=set)
execution_order: list["GraphNode"] = field(default_factory=list)
start_time: float = field(default_factory=time.time)
# Results
results: dict[str, NodeResult] = field(default_factory=dict)
# Accumulated metrics
accumulated_usage: Usage = field(default_factory=lambda: Usage(inputTokens=0, outputTokens=0, totalTokens=0))
accumulated_metrics: Metrics = field(default_factory=lambda: Metrics(latencyMs=0))
execution_count: int = 0
execution_time: int = 0
# Graph structure info
total_nodes: int = 0
edges: list[tuple["GraphNode", "GraphNode"]] = field(default_factory=list)
entry_points: list["GraphNode"] = field(default_factory=list)
def should_continue(
self,
max_node_executions: int | None,
execution_timeout: float | None,
) -> tuple[bool, str]:
"""Check if the graph should continue execution.
Returns: (should_continue, reason)
"""
# Check node execution limit (only if set)
if max_node_executions is not None and len(self.execution_order) >= max_node_executions:
return False, f"Max node executions reached: {max_node_executions}"
# Check timeout (only if set)
if execution_timeout is not None:
elapsed = self.execution_time / 1000 + time.time() - self.start_time
if elapsed > execution_timeout:
return False, f"Execution timed out: {execution_timeout}s"
return True, "Continuing"
@dataclass
class GraphResult(MultiAgentResult):
"""Result from graph execution - extends MultiAgentResult with graph-specific details."""
total_nodes: int = 0
completed_nodes: int = 0
failed_nodes: int = 0
interrupted_nodes: int = 0
execution_order: list["GraphNode"] = field(default_factory=list)
edges: list[tuple["GraphNode", "GraphNode"]] = field(default_factory=list)
entry_points: list["GraphNode"] = field(default_factory=list)
@dataclass
class GraphEdge:
"""Represents an edge in the graph with an optional condition."""
from_node: "GraphNode"
to_node: "GraphNode"
condition: Callable[[GraphState], bool] | None = None
def __hash__(self) -> int:
"""Return hash for GraphEdge based on from_node and to_node."""
return hash((self.from_node.node_id, self.to_node.node_id))
def should_traverse(self, state: GraphState) -> bool:
"""Check if this edge should be traversed based on condition."""
if self.condition is None:
return True
return self.condition(state)
@dataclass
class GraphNode:
"""Represents a node in the graph."""
node_id: str
executor: Agent | MultiAgentBase
dependencies: set["GraphNode"] = field(default_factory=set)
execution_status: Status = Status.PENDING
result: NodeResult | None = None
execution_time: int = 0
_initial_messages: Messages = field(default_factory=list, init=False)
_initial_state: AgentState = field(default_factory=AgentState, init=False)
def __post_init__(self) -> None:
"""Capture initial executor state after initialization."""
# Deep copy the initial messages and state to preserve them
if hasattr(self.executor, "messages"):
self._initial_messages = copy.deepcopy(self.executor.messages)
if hasattr(self.executor, "state") and hasattr(self.executor.state, "get"):
self._initial_state = AgentState(self.executor.state.get())
def reset_executor_state(self) -> None:
"""Reset GraphNode executor state to initial state when graph was created.
This is useful when nodes are executed multiple times and need to start
fresh on each execution, providing stateless behavior.
"""
if hasattr(self.executor, "messages"):
self.executor.messages = copy.deepcopy(self._initial_messages)
if hasattr(self.executor, "state"):
self.executor.state = AgentState(self._initial_state.get())
# Reset execution status
self.execution_status = Status.PENDING
self.result = None
def __hash__(self) -> int:
"""Return hash for GraphNode based on node_id."""
return hash(self.node_id)
def __eq__(self, other: Any) -> bool:
"""Return equality for GraphNode based on node_id."""
if not isinstance(other, GraphNode):
return False
return self.node_id == other.node_id
def _validate_node_executor(
executor: Agent | MultiAgentBase, existing_nodes: dict[str, GraphNode] | None = None
) -> None:
"""Validate a node executor for graph compatibility.
Args:
executor: The executor to validate
existing_nodes: Optional dict of existing nodes to check for duplicates
"""
# Check for duplicate node instances
if existing_nodes:
seen_instances = {id(node.executor) for node in existing_nodes.values()}
if id(executor) in seen_instances:
raise ValueError("Duplicate node instance detected. Each node must have a unique object instance.")
# Validate Agent-specific constraints
if isinstance(executor, Agent):
# Check for session persistence
if executor._session_manager is not None:
raise ValueError("Session persistence is not supported for Graph agents yet.")
class GraphBuilder:
"""Builder pattern for constructing graphs."""
def __init__(self) -> None:
"""Initialize GraphBuilder with empty collections."""
self.nodes: dict[str, GraphNode] = {}
self.edges: set[GraphEdge] = set()
self.entry_points: set[GraphNode] = set()
# Configuration options
self._max_node_executions: int | None = None
self._execution_timeout: float | None = None
self._node_timeout: float | None = None
self._reset_on_revisit: bool = False
self._id: str = _DEFAULT_GRAPH_ID
self._session_manager: SessionManager | None = None
self._hooks: list[HookProvider] | None = None
def add_node(self, executor: Agent | MultiAgentBase, node_id: str | None = None) -> GraphNode:
"""Add an Agent or MultiAgentBase instance as a node to the graph."""
_validate_node_executor(executor, self.nodes)
# Auto-generate node_id if not provided
if node_id is None:
node_id = getattr(executor, "id", None) or getattr(executor, "name", None) or f"node_{len(self.nodes)}"
if node_id in self.nodes:
raise ValueError(f"Node '{node_id}' already exists")
node = GraphNode(node_id=node_id, executor=executor)
self.nodes[node_id] = node
return node
def add_edge(
self,
from_node: str | GraphNode,
to_node: str | GraphNode,
condition: Callable[[GraphState], bool] | None = None,
) -> GraphEdge:
"""Add an edge between two nodes with optional condition function that receives full GraphState."""
def resolve_node(node: str | GraphNode, node_type: str) -> GraphNode:
if isinstance(node, str):
if node not in self.nodes:
raise ValueError(f"{node_type} node '{node}' not found")
return self.nodes[node]
else:
if node not in self.nodes.values():
raise ValueError(f"{node_type} node object has not been added to the graph, use graph.add_node")
return node
from_node_obj = resolve_node(from_node, "Source")
to_node_obj = resolve_node(to_node, "Target")
# Add edge and update dependencies
edge = GraphEdge(from_node=from_node_obj, to_node=to_node_obj, condition=condition)
self.edges.add(edge)
to_node_obj.dependencies.add(from_node_obj)
return edge
def set_entry_point(self, node_id: str) -> "GraphBuilder":
"""Set a node as an entry point for graph execution."""
if node_id not in self.nodes:
raise ValueError(f"Node '{node_id}' not found")
self.entry_points.add(self.nodes[node_id])
return self
def reset_on_revisit(self, enabled: bool = True) -> "GraphBuilder":
"""Control whether nodes reset their state when revisited.
When enabled, nodes will reset their messages and state to initial values
each time they are revisited (re-executed). This is useful for stateless
behavior where nodes should start fresh on each revisit.
Args:
enabled: Whether to reset node state when revisited (default: True)
"""
self._reset_on_revisit = enabled
return self
def set_max_node_executions(self, max_executions: int) -> "GraphBuilder":
"""Set maximum number of node executions allowed.
Args:
max_executions: Maximum total node executions (None for no limit)
"""
self._max_node_executions = max_executions
return self
def set_execution_timeout(self, timeout: float) -> "GraphBuilder":
"""Set total execution timeout.
Args:
timeout: Total execution timeout in seconds (None for no limit)
"""
self._execution_timeout = timeout
return self
def set_node_timeout(self, timeout: float) -> "GraphBuilder":
"""Set individual node execution timeout.
Args:
timeout: Individual node timeout in seconds (None for no limit)
"""
self._node_timeout = timeout
return self
def set_graph_id(self, graph_id: str) -> "GraphBuilder":
"""Set graph id.
Args:
graph_id: Unique graph id
"""
self._id = graph_id
return self
def set_session_manager(self, session_manager: SessionManager) -> "GraphBuilder":
"""Set session manager for the graph.
Args:
session_manager: SessionManager instance
"""
self._session_manager = session_manager
return self
def set_hook_providers(self, hooks: list[HookProvider]) -> "GraphBuilder":
"""Set hook providers for the graph.
Args:
hooks: Customer hooks user passes in
"""
self._hooks = hooks
return self
def build(self) -> "Graph":
"""Build and validate the graph with configured settings."""
if not self.nodes:
raise ValueError("Graph must contain at least one node")
# Auto-detect entry points if none specified
if not self.entry_points:
self.entry_points = {node for node_id, node in self.nodes.items() if not node.dependencies}
logger.debug(
"entry_points=<%s> | auto-detected entrypoints", ", ".join(node.node_id for node in self.entry_points)
)
if not self.entry_points:
raise ValueError("No entry points found - all nodes have dependencies")
# Validate entry points and check for cycles
self._validate_graph()
return Graph(
nodes=self.nodes.copy(),
edges=self.edges.copy(),
entry_points=self.entry_points.copy(),
max_node_executions=self._max_node_executions,
execution_timeout=self._execution_timeout,
node_timeout=self._node_timeout,
reset_on_revisit=self._reset_on_revisit,
session_manager=self._session_manager,
hooks=self._hooks,
id=self._id,
)
def _validate_graph(self) -> None:
"""Validate graph structure."""
# Validate entry points exist
entry_point_ids = {node.node_id for node in self.entry_points}
invalid_entries = entry_point_ids - set(self.nodes.keys())
if invalid_entries:
raise ValueError(f"Entry points not found in nodes: {invalid_entries}")
# Warn about potential infinite loops if no execution limits are set
if self._max_node_executions is None and self._execution_timeout is None:
logger.warning("Graph without execution limits may run indefinitely if cycles exist")
class Graph(MultiAgentBase):
"""Directed Graph multi-agent orchestration with configurable revisit behavior."""
def __init__(
self,
nodes: dict[str, GraphNode],
edges: set[GraphEdge],
entry_points: set[GraphNode],
max_node_executions: int | None = None,
execution_timeout: float | None = None,
node_timeout: float | None = None,
reset_on_revisit: bool = False,
session_manager: SessionManager | None = None,
hooks: list[HookProvider] | None = None,
id: str = _DEFAULT_GRAPH_ID,
trace_attributes: Mapping[str, AttributeValue] | None = None,
) -> None:
"""Initialize Graph with execution limits and reset behavior.
Args:
nodes: Dictionary of node_id to GraphNode
edges: Set of GraphEdge objects
entry_points: Set of GraphNode objects that are entry points
max_node_executions: Maximum total node executions (default: None - no limit)
execution_timeout: Total execution timeout in seconds (default: None - no limit)
node_timeout: Individual node timeout in seconds (default: None - no limit)
reset_on_revisit: Whether to reset node state when revisited (default: False)
session_manager: Session manager for persisting graph state and execution history (default: None)
hooks: List of hook providers for monitoring and extending graph execution behavior (default: None)
id: Unique graph id (default: None)
trace_attributes: Custom trace attributes to apply to the agent's trace span (default: None)
"""
super().__init__()
# Validate nodes for duplicate instances
self._validate_graph(nodes)
self.nodes = nodes
self.edges = edges
self.entry_points = entry_points
self.max_node_executions = max_node_executions
self.execution_timeout = execution_timeout
self.node_timeout = node_timeout
self.reset_on_revisit = reset_on_revisit
self.state = GraphState()
self._interrupt_state = _InterruptState()
self.tracer = get_tracer()
self.trace_attributes: dict[str, AttributeValue] = self._parse_trace_attributes(trace_attributes)
self.session_manager = session_manager
self.hooks = HookRegistry()
if self.session_manager:
self.hooks.add_hook(self.session_manager)
if hooks:
for hook in hooks:
self.hooks.add_hook(hook)
self._resume_next_nodes: list[GraphNode] = []
self._resume_from_session = False
self.id = id
run_async(lambda: self.hooks.invoke_callbacks_async(MultiAgentInitializedEvent(self)))
def __call__(
self, task: MultiAgentInput, invocation_state: dict[str, Any] | None = None, **kwargs: Any
) -> GraphResult:
"""Invoke the graph synchronously.
Args:
task: The task to execute
invocation_state: Additional state/context passed to underlying agents.
Defaults to None to avoid mutable default argument issues.
**kwargs: Keyword arguments allowing backward compatible future changes.
"""
if invocation_state is None:
invocation_state = {}
return run_async(lambda: self.invoke_async(task, invocation_state))
async def invoke_async(
self, task: MultiAgentInput, invocation_state: dict[str, Any] | None = None, **kwargs: Any
) -> GraphResult:
"""Invoke the graph asynchronously.
This method uses stream_async internally and consumes all events until completion,
following the same pattern as the Agent class.
Args:
task: The task to execute
invocation_state: Additional state/context passed to underlying agents.
Defaults to None to avoid mutable default argument issues.
**kwargs: Keyword arguments allowing backward compatible future changes.
"""
events = self.stream_async(task, invocation_state, **kwargs)
final_event = None
async for event in events:
final_event = event
if final_event is None or "result" not in final_event:
raise ValueError("Graph streaming completed without producing a result event")
return cast(GraphResult, final_event["result"])
async def stream_async(
self, task: MultiAgentInput, invocation_state: dict[str, Any] | None = None, **kwargs: Any
) -> AsyncIterator[dict[str, Any]]:
"""Stream events during graph execution.
Args:
task: The task to execute
invocation_state: Additional state/context passed to underlying agents.
Defaults to None to avoid mutable default argument issues.
**kwargs: Keyword arguments allowing backward compatible future changes.
Yields:
Dictionary events during graph execution, such as:
- multi_agent_node_start: When a node begins execution
- multi_agent_node_stream: Forwarded agent/multi-agent events with node context
- multi_agent_node_stop: When a node stops execution
- result: Final graph result
"""
self._interrupt_state.resume(task)
if invocation_state is None:
invocation_state = {}
await self.hooks.invoke_callbacks_async(BeforeMultiAgentInvocationEvent(self, invocation_state))
logger.debug("task=<%s> | starting graph execution", task)
# Initialize state
start_time = time.time()
if not self._resume_from_session and not self._interrupt_state.activated:
# Initialize state
self.state = GraphState(
status=Status.EXECUTING,
task=task,
total_nodes=len(self.nodes),
edges=[(edge.from_node, edge.to_node) for edge in self.edges],
entry_points=list(self.entry_points),
start_time=start_time,
)
else:
self.state.status = Status.EXECUTING
self.state.start_time = start_time
span = self.tracer.start_multiagent_span(task, "graph", custom_trace_attributes=self.trace_attributes)
with trace_api.use_span(span, end_on_exit=True):
interrupts = []
try:
logger.debug(
"max_node_executions=<%s>, execution_timeout=<%s>s, node_timeout=<%s>s | graph execution config",
self.max_node_executions or "None",
self.execution_timeout or "None",
self.node_timeout or "None",
)
async for event in self._execute_graph(invocation_state):
if isinstance(event, MultiAgentNodeInterruptEvent):
interrupts.extend(event.interrupts)
yield event.as_dict()
# Set final status based on execution results
if self.state.failed_nodes:
self.state.status = Status.FAILED
elif self.state.status == Status.EXECUTING:
self.state.status = Status.COMPLETED
logger.debug("status=<%s> | graph execution completed", self.state.status)
# Yield final result (consistent with Agent's AgentResultEvent format)
result = self._build_result(interrupts)
# Use the same event format as Agent for consistency
yield MultiAgentResultEvent(result=result).as_dict()
except Exception:
logger.exception("graph execution failed")
self.state.status = Status.FAILED
raise
finally:
self.state.execution_time += round((time.time() - start_time) * 1000)
await self.hooks.invoke_callbacks_async(AfterMultiAgentInvocationEvent(self))
self._resume_from_session = False
self._resume_next_nodes.clear()
def _validate_graph(self, nodes: dict[str, GraphNode]) -> None:
"""Validate graph nodes for duplicate instances."""
# Check for duplicate node instances
seen_instances = set()
for node in nodes.values():
if id(node.executor) in seen_instances:
raise ValueError("Duplicate node instance detected. Each node must have a unique object instance.")
seen_instances.add(id(node.executor))
# Validate Agent-specific constraints for each node
_validate_node_executor(node.executor)
def _activate_interrupt(
self, node: GraphNode, interrupts: list[Interrupt], from_hook: bool = False
) -> MultiAgentNodeInterruptEvent:
"""Activate the interrupt state.
Args:
node: The interrupted node.
interrupts: The interrupts raised by the user.
from_hook: Whether the interrupt originated from a hook (e.g., BeforeNodeCallEvent).
Returns:
MultiAgentNodeInterruptEvent
"""
logger.debug("node=<%s>, from_hook=<%s> | node interrupted", node.node_id, from_hook)
node.execution_status = Status.INTERRUPTED
self.state.status = Status.INTERRUPTED
self.state.interrupted_nodes.add(node)
self._interrupt_state.interrupts.update({interrupt.id: interrupt for interrupt in interrupts})
self._interrupt_state.activate()
self._interrupt_state.context[node.node_id] = {
"from_hook": from_hook,
"interrupt_ids": [interrupt.id for interrupt in interrupts],
}
if isinstance(node.executor, Agent):
self._interrupt_state.context[node.node_id].update(
{
"interrupt_state": node.executor._interrupt_state.to_dict(),
"state": node.executor.state.get(),
"messages": node.executor.messages,
}
)
return MultiAgentNodeInterruptEvent(node.node_id, interrupts)
async def _execute_graph(self, invocation_state: dict[str, Any]) -> AsyncIterator[Any]:
"""Execute graph and yield TypedEvent objects."""
if self._interrupt_state.activated:
ready_nodes = [self.nodes[node_id] for node_id in self._interrupt_state.context["completed_nodes"]]
ready_nodes.extend(self.state.interrupted_nodes)
self.state.interrupted_nodes.clear()
elif self._resume_from_session:
ready_nodes = self._resume_next_nodes
else:
ready_nodes = list(self.entry_points)
while ready_nodes:
# Check execution limits before continuing
should_continue, reason = self.state.should_continue(
max_node_executions=self.max_node_executions,
execution_timeout=self.execution_timeout,
)
if not should_continue:
self.state.status = Status.FAILED
logger.debug("reason=<%s> | stopping execution", reason)
return # Let the top-level exception handler deal with it
current_batch = ready_nodes.copy()
ready_nodes.clear()
# Execute current batch
async for event in self._execute_nodes_parallel(current_batch, invocation_state):
yield event
if self.state.status == Status.INTERRUPTED:
self._interrupt_state.context["completed_nodes"] = [
node.node_id for node in current_batch if node.execution_status == Status.COMPLETED
]
return
self._interrupt_state.deactivate()
# Find newly ready nodes after batch execution
# We add all nodes in current batch as completed batch,
# because a failure would throw exception and code would not make it here
newly_ready = self._find_newly_ready_nodes(current_batch)
# Emit handoff event for batch transition if there are nodes to transition to
if newly_ready:
handoff_event = MultiAgentHandoffEvent(
from_node_ids=[node.node_id for node in current_batch],
to_node_ids=[node.node_id for node in newly_ready],
)
yield handoff_event
logger.debug(
"from_node_ids=<%s>, to_node_ids=<%s> | batch transition",
[node.node_id for node in current_batch],
[node.node_id for node in newly_ready],
)
ready_nodes.extend(newly_ready)
async def _execute_nodes_parallel(
self, nodes: list["GraphNode"], invocation_state: dict[str, Any]
) -> AsyncIterator[Any]:
"""Execute multiple nodes in parallel and merge their event streams in real-time.
Uses a shared queue where each node's stream runs independently and pushes events
as they occur, enabling true real-time event propagation without round-robin delays.
"""
if self._interrupt_state.activated:
nodes = [node for node in nodes if node.execution_status == Status.INTERRUPTED]
event_queue: asyncio.Queue[Any | None | Exception] = asyncio.Queue()
# Start all node streams as independent tasks
tasks = [asyncio.create_task(self._stream_node_to_queue(node, event_queue, invocation_state)) for node in nodes]
try:
# Consume events from the queue as they arrive
# Continue until all tasks are done
while any(not task.done() for task in tasks):
try:
# Use timeout to avoid race condition: if all tasks complete between
# checking task.done() and calling queue.get(), we'd hang forever.
# The 0.1s timeout allows us to periodically re-check task completion
# while still being responsive to incoming events.
event = await asyncio.wait_for(event_queue.get(), timeout=0.1)
except asyncio.TimeoutError:
# No event available, continue checking tasks
continue
# Check if it's an exception - fail fast
if isinstance(event, Exception):
# Cancel all other tasks immediately
for task in tasks:
if not task.done():
task.cancel()
raise event
if event is not None:
yield event
# Process any remaining events in the queue after all tasks complete
while not event_queue.empty():
event = await event_queue.get()
if isinstance(event, Exception):
raise event
if event is not None:
yield event
finally:
# Cancel any remaining tasks
remaining_tasks = [task for task in tasks if not task.done()]
if remaining_tasks:
logger.warning(
"remaining_task_count=<%d> | cancelling remaining tasks in finally block",
len(remaining_tasks),
)
for task in remaining_tasks:
task.cancel()
await asyncio.gather(*tasks, return_exceptions=True)
async def _stream_node_to_queue(
self,
node: GraphNode,
event_queue: asyncio.Queue[Any | None | Exception],
invocation_state: dict[str, Any],
) -> None:
"""Stream events from a node to the shared queue with optional timeout."""
try:
# Apply timeout to the entire streaming process if configured
if self.node_timeout is not None:
async def stream_node() -> None:
async for event in self._execute_node(node, invocation_state):
await event_queue.put(event)
try:
await asyncio.wait_for(stream_node(), timeout=self.node_timeout)
except asyncio.TimeoutError:
# Handle timeout and send exception through queue
timeout_exc = await self._handle_node_timeout(node, event_queue)
await event_queue.put(timeout_exc)
else:
# No timeout - stream normally
async for event in self._execute_node(node, invocation_state):
await event_queue.put(event)
except Exception as e:
# Send exception through queue for fail-fast behavior
await event_queue.put(e)
finally:
await event_queue.put(None)
async def _handle_node_timeout(self, node: GraphNode, event_queue: asyncio.Queue[Any | None]) -> Exception:
"""Handle a node timeout by creating a failed result and emitting events.
Returns:
The timeout exception to be re-raised for fail-fast behavior
"""
assert self.node_timeout is not None
timeout_exception = Exception(f"Node '{node.node_id}' execution timed out after {self.node_timeout}s")
node_result = NodeResult(
result=timeout_exception,
execution_time=round(self.node_timeout * 1000),
status=Status.FAILED,
accumulated_usage=Usage(inputTokens=0, outputTokens=0, totalTokens=0),
accumulated_metrics=Metrics(latencyMs=round(self.node_timeout * 1000)),
execution_count=1,
)
node.execution_status = Status.FAILED
node.result = node_result
node.execution_time = node_result.execution_time
self.state.failed_nodes.add(node)
self.state.results[node.node_id] = node_result
complete_event = MultiAgentNodeStopEvent(
node_id=node.node_id,
node_result=node_result,
)
await event_queue.put(complete_event)
return timeout_exception
def _find_newly_ready_nodes(self, completed_batch: list["GraphNode"]) -> list["GraphNode"]:
"""Find nodes that became ready after the last execution."""
newly_ready = []
for _node_id, node in self.nodes.items():
if self._is_node_ready_with_conditions(node, completed_batch):
newly_ready.append(node)
return newly_ready
def _is_node_ready_with_conditions(self, node: GraphNode, completed_batch: list["GraphNode"]) -> bool:
"""Check if a node is ready considering conditional edges."""
# Get incoming edges to this node
incoming_edges = [edge for edge in self.edges if edge.to_node == node]
# Check if at least one incoming edge condition is satisfied
for edge in incoming_edges:
if edge.from_node in completed_batch:
if edge.should_traverse(self.state):
logger.debug(
"from=<%s>, to=<%s> | edge ready via satisfied condition", edge.from_node.node_id, node.node_id
)
return True
else:
logger.debug(
"from=<%s>, to=<%s> | edge condition not satisfied", edge.from_node.node_id, node.node_id
)
return False
async def _execute_node(self, node: GraphNode, invocation_state: dict[str, Any]) -> AsyncIterator[Any]:
"""Execute a single node and yield TypedEvent objects."""
# Reset the node's state if reset_on_revisit is enabled, and it's being revisited
if self.reset_on_revisit and node in self.state.completed_nodes:
logger.debug("node_id=<%s> | resetting node state for revisit", node.node_id)
node.reset_executor_state()
self.state.completed_nodes.remove(node)
node.execution_status = Status.EXECUTING
logger.debug("node_id=<%s> | executing node", node.node_id)
# Emit node start event
start_event = MultiAgentNodeStartEvent(
node_id=node.node_id, node_type="agent" if isinstance(node.executor, Agent) else "multiagent"
)
yield start_event
before_event, interrupts = await self.hooks.invoke_callbacks_async(
BeforeNodeCallEvent(self, node.node_id, invocation_state)
)
start_time = time.time()
try:
if interrupts:
yield self._activate_interrupt(node, interrupts, from_hook=True)
return
if before_event.cancel_node:
cancel_message = (
before_event.cancel_node if isinstance(before_event.cancel_node, str) else "node cancelled by user"
)
logger.debug("reason=<%s> | cancelling execution", cancel_message)
yield MultiAgentNodeCancelEvent(node.node_id, cancel_message)
raise RuntimeError(cancel_message)
# Build node input from satisfied dependencies
node_input = self._build_node_input(node)
# Execute and stream events (timeout handled at task level)
if isinstance(node.executor, MultiAgentBase):
# For nested multi-agent systems, stream their events and collect result
multi_agent_result = None
async for event in node.executor.stream_async(node_input, invocation_state):
# Forward nested multi-agent events with node context
wrapped_event = MultiAgentNodeStreamEvent(node.node_id, event)
yield wrapped_event
# Capture the final result event
if "result" in event:
multi_agent_result = event["result"]
# Use the captured result from streaming (no double execution)
if multi_agent_result is None:
raise ValueError(f"Node '{node.node_id}' did not produce a result event")
node_result = NodeResult(
result=multi_agent_result,
execution_time=multi_agent_result.execution_time,
status=multi_agent_result.status,
accumulated_usage=multi_agent_result.accumulated_usage,
accumulated_metrics=multi_agent_result.accumulated_metrics,
execution_count=multi_agent_result.execution_count,
interrupts=multi_agent_result.interrupts,
)
elif isinstance(node.executor, Agent):
# For agents, stream their events and collect result
agent_response = None
async for event in node.executor.stream_async(node_input, invocation_state=invocation_state):
# Forward agent events with node context
wrapped_event = MultiAgentNodeStreamEvent(node.node_id, event)
yield wrapped_event
# Capture the final result event
if "result" in event:
agent_response = event["result"]
# Use the captured result from streaming (no double execution)
if agent_response is None:
raise ValueError(f"Node '{node.node_id}' did not produce a result event")
# Extract metrics with defaults
response_metrics = getattr(agent_response, "metrics", None)
usage = getattr(
response_metrics, "accumulated_usage", Usage(inputTokens=0, outputTokens=0, totalTokens=0)
)
metrics = getattr(response_metrics, "accumulated_metrics", Metrics(latencyMs=0))
node_result = NodeResult(
result=agent_response,
execution_time=round((time.time() - start_time) * 1000),
status=Status.INTERRUPTED if agent_response.stop_reason == "interrupt" else Status.COMPLETED,
accumulated_usage=usage,
accumulated_metrics=metrics,
execution_count=1,
interrupts=agent_response.interrupts or [],
)
else:
raise ValueError(f"Node '{node.node_id}' of type '{type(node.executor)}' is not supported")
node.result = node_result
node.execution_time = node_result.execution_time
if node_result.status == Status.INTERRUPTED:
yield self._activate_interrupt(node, node_result.interrupts)
return
# Mark as completed
node.execution_status = Status.COMPLETED
self.state.completed_nodes.add(node)
self.state.results[node.node_id] = node_result
self.state.execution_order.append(node)
# Accumulate metrics
self._accumulate_metrics(node_result)
# Emit node stop event with full NodeResult
complete_event = MultiAgentNodeStopEvent(
node_id=node.node_id,
node_result=node_result,
)
yield complete_event
logger.debug(
"node_id=<%s>, execution_time=<%dms> | node completed successfully",
node.node_id,
node.execution_time,
)
except Exception as e:
# All failures (programming errors and execution failures) stop graph execution
# This matches the old fail-fast behavior
logger.error("node_id=<%s>, error=<%s> | node failed", node.node_id, e)
execution_time = round((time.time() - start_time) * 1000)
# Create a NodeResult for the failed node
node_result = NodeResult(
result=e,
execution_time=execution_time,
status=Status.FAILED,
accumulated_usage=Usage(inputTokens=0, outputTokens=0, totalTokens=0),
accumulated_metrics=Metrics(latencyMs=execution_time),
execution_count=1,
)
node.execution_status = Status.FAILED
node.result = node_result
node.execution_time = execution_time