5 ms·
More pointers and more processing in exchange for representing equivalence classes of many, often infinitely many graphs compactly and enumerating them efficien
by HelloNurse 4y ago
More pointers and more processing in exchange for representing equivalence classes of many, often infinitely many graphs compactly and enumerating them efficiently. Usually not relevant when equivalence of simple nodes is the object.