Refactor graph/tree traversal to iterative implementations #6

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.

Sign up for GitHub

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

Jump to bottom

Open

theplatypus wants to merge 1 commit into master from codex/refactor-graph-and-tree-methods-to-avoid-recursion

Owner

theplatypus commented Jun 23, 2025

Summary

rewrite Graph.to_tree, Tree.enumerate_nodes, and Tree.score_tree to use iterative DFS
add new BFS/DFS helpers on graphs and trees
keep recursive versions for benchmarking and create a small benchmark script

Testing

python3 -m compileall -q scott
PYTHONPATH=. python3 test/bench/bench_recursion.py | head -n 20

https://chatgpt.com/codex/tasks/task_e_68592c87ace4832fa12ca256a245431d


          Add iterative traversal implementations and benchmarks

6b4d17a

theplatypus added the codex label

— with

ChatGPT Codex Connector

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels