Optimize DFS #6440
Merged
Optimize DFS #6440
Conversation
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
Signed-off-by: Po-Chu Hsu <tonypottera@gmail.com>
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## main #6440 +/- ##
==========================================
- Coverage 57.25% 57.25% -0.01%
==========================================
Files 507 507
Lines 31433 31432 -1
Branches 4690 4689 -1
==========================================
- Hits 17997 17996 -1
+ Misses 12581 12580 -1
- Partials 855 856 +1 ☔ View full report in Codecov by Sentry. |
justinchuby
approved these changes
Oct 9, 2024
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.
Description
Optimize the dfs function by merging two for loop into one.
Motivation and Context
There's no meaning to keep
stack += nodes[node_index].inputin an independent for loop.