search

egraphs-good / extraction-gym

benchmarking e-graph extraction
MIT License
27 stars 16 forks source link

Faster bottom up algorithm based on faster-greedy-dag #20

Closed oflatt closed 9 months ago

oflatt commented 10 months ago

@TrevorHansen's optimization using parent pointers also makes the bottom up algorithm without sharing faster

cumulative time for bottom-up: 2509ms
cumulative time for faster-bottom-up: 1930ms