Change GraphExecutionState's _get_next_node method to prioritize Iterate Nodes #6032
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.
Summary
This PR optimizes the graph execution order by prioritizing Iterate nodes and their children, ensuring the correct execution sequence. The changes made to the _get_next_node method within the GraphExecutionState class address the issue of random output order and execution of Iterate node children.
Key changes include:
These improvements provide a more predictable and intuitive behavior for Iterate nodes.
Related Issues / Discussions
QA Instructions
To test the changes in this PR:
Before this change, the index 0 item would be executed in a random order. With these changes, the execution order should be consistent and aligned with the index attribute of the Iterate nodes.
Merge Plan
Checklist