Programming, Binary Decision Diagrams, Computer Science, Boolean.
diagram, the BDD also stores a hash table mapping each node to its index in the array. Whenever a new node is inserted, the hash table is queried to ensure it is unique. Two nodes are considered duplicates if they match in all three attributes: the variable they represent, and their two pointers.