-
-
Notifications
You must be signed in to change notification settings - Fork 1.7k
tsort: fix minimal cycle reporting and precise back-edge removal (no refactors) #8786
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
|
GNU testsuite comparison: |
7a4ae04 to
e590069
Compare
|
GNU testsuite comparison: |
CodSpeed Performance ReportMerging #8786 will improve performances by 46.74%Comparing Summary
Benchmarks breakdown
Footnotes |
|
GNU testsuite comparison: |
|
GNU testsuite comparison: |
|
@naoNao89 this looks good, but there's an open PR for handling a stack overflow in the cycle code that will impact this PR |
36249db to
5f0c697
Compare
|
GNU testsuite comparison: |
anastygnome
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looks good, just one thing that should be fixed :)
…oval with iterative DFS - Implement iterative DFS to prevent stack overflows (from PR uutils#8737) - Fix minimal cycle reporting to show only actual cycle nodes - Remove redundant back-edge from last cycle node to first - Update test expectations for corrected cycle handling
5f0c697 to
4d6fdea
Compare
|
GNU testsuite comparison: |
|
GNU testsuite comparison: |
…oval with iterative DFS (uutils#8786) - Implement iterative DFS to prevent stack overflows (from PR uutils#8737) - Fix minimal cycle reporting to show only actual cycle nodes - Remove redundant back-edge from last cycle node to first - Update test expectations for corrected cycle handling
…oval with iterative DFS (uutils#8786) - Implement iterative DFS to prevent stack overflows (from PR uutils#8737) - Fix minimal cycle reporting to show only actual cycle nodes - Remove redundant back-edge from last cycle node to first - Update test expectations for corrected cycle handling
…oval with iterative DFS (uutils#8786) - Implement iterative DFS to prevent stack overflows (from PR uutils#8737) - Fix minimal cycle reporting to show only actual cycle nodes - Remove redundant back-edge from last cycle node to first - Update test expectations for corrected cycle handling
…oval with iterative DFS (uutils#8786) - Implement iterative DFS to prevent stack overflows (from PR uutils#8737) - Fix minimal cycle reporting to show only actual cycle nodes - Remove redundant back-edge from last cycle node to first - Update test expectations for corrected cycle handling
Fixies #8743
This PR fixes incorrect loop reporting in tsort by reporting only the minimal cycle subpath and removing the precise back-edge that closes the cycle. No performance refactors or unrelated changes are included.