Struct EGraph 

pub struct EGraph { /* private fields */ }

E-graph with congruence closure.

Combines a Union-Find for equivalence classes with hash-consing for structural sharing and use lists for efficient congruence propagation.

Implementations

impl EGraph

pub fn new() -> Self

pub fn add(&mut self, node: ENode) -> usize

Add a node, return its ID (hash-consed)

pub fn merge(&mut self, a: usize, b: usize)

Merge two terms and propagate congruences

pub fn equivalent(&mut self, a: usize, b: usize) -> bool

Check if two terms are in the same equivalence class