A minimal, pedagogical e-graph implementation in Rust. About 1800 lines of code, no dependencies.

Illustrates the core algorithms but does not compete with production implementations (like egg) on performance.

cargo build
cargo test
cargo test --features analysis

cargo run --example arith
cargo run --example boolean
cargo run --example array
cargo run --example constfold --features analysis

This project is licensed under the MIT License. See the LICENSE file for details.