-
-
Notifications
You must be signed in to change notification settings - Fork 1.6k
tsort: use iterative dfs to prevent stack overflows #8737
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
base: main
Are you sure you want to change the base?
Conversation
please add a test that trigger the stackoverflow |
CodSpeed Performance ReportMerging #8737 will not alter performanceComparing Summary
Footnotes
|
0de2521
to
0d6ba6d
Compare
GNU testsuite comparison:
|
GNU testsuite comparison:
|
0d6ba6d
to
86c8710
Compare
86c8710
to
f5dfb27
Compare
GNU testsuite comparison:
|
a9c5528
to
90ac3c2
Compare
90ac3c2
to
8f0bf8b
Compare
GNU testsuite comparison:
|
Rewrite DFS method in iterative way to avoid stack overflows
Closes #8695
PR is on top of #8694
but changes are independent. Only top commit can be cherry-picked, if needed