Optimal E-Graph Extraction

[samuelsonric]

Hi! I implemented this dynamic programming algorithm for optimal e-graph extraction.

https://dl.acm.org/doi/abs/10.1145/3689801

Afterwards, I realized that the extractions computed by the algorithm are not guaranteed to be acyclic. Would Metatheory.jl be interested in a PR? Or is this algorithm useless?

Thanks!

[0x0f0f0f]

That would be interesting! Yeah. I am lately quite busy and don't have much time to spend behind metatheory.jl, but I can take a look at the PR. Please, if you could add some test file in the tutorials page, formatted with Literate.jl style, it would go in the documentation.

Thanks a lot!