Skip to content
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

Simple Examples #6

Merged
merged 4 commits into from
Jan 12, 2024
Merged

Simple Examples #6

merged 4 commits into from
Jan 12, 2024

Conversation

philzook58
Copy link
Contributor

3 simple examples where you can eyeball the optimal dag cost and can be scaled arbitrarily large.

  1. AC to extract perfectly balanced trees
  2. A list of binary choices where one choice has more sharing
  3. A loop extraction example where you need a constraint to block extracting a loop instead of a term

@mwillsey
Copy link
Member

mwillsey commented Oct 23, 2023

This looks great @philzook58! What is up with the funky names and costs in the nodes json though? Is the "newer" exporting code in egglog doing this or could it perhaps generate better names?

@mwillsey mwillsey marked this pull request as ready for review January 12, 2024 19:49
@mwillsey mwillsey merged commit c04b7fc into egraphs-good:main Jan 12, 2024
2 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants