Parallel execution of graph nodes#45
Merged
jamescalam merged 1 commit intoaurelio-labs:james/parallel-nodesfrom Sep 8, 2025
Merged
Parallel execution of graph nodes#45jamescalam merged 1 commit intoaurelio-labs:james/parallel-nodesfrom
jamescalam merged 1 commit intoaurelio-labs:james/parallel-nodesfrom
Conversation
721bb11
into
aurelio-labs:james/parallel-nodes
5 of 7 checks passed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR introduces native support for parallel execution of graph branches and adds a convenience method for explicitly defining parallel successors.
Parallel branch execution:
The Graph now detects when a node has more than one outgoing edge and will run each branch concurrently via asyncio.gather, merging their outputs back into a single state. Nested parallelism is supported, and existing router behaviour (choosing a single successor via the "choice" key) remains unchanged.
New helper – add_parallel()
To make it explicit when multiple successors should be treated as parallel, Graph.add_parallel(source, destinations) wraps multiple add_edge calls. When executing, any node with more than one successor will automatically be run in parallel.
Internal refactoring:
Added _get_next_nodes() to return all successors of a node.
Added _invoke_node() to handle callback start/stop and streaming logic in one place.
Added a recursive _execute_branch() that walks a branch, spawns concurrent tasks for parallel branches, and merges their results.
Updated execute() to delegate to _execute_branch() and to clean up callbacks correctly at the end.