 Binary decision diagram

A directed acyclic graph representing a Boolean function. A decision node tests a Boolean variable and has zero and one successors; evaluation follows the corresponding arrows until a terminal node returns a Boolean value. Sharing subgraphs can make a binary decision diagram much smaller than a binary decision tree.

A Binary Decision Diagram (BDD) is a data structure that is used to represent Boolean functions in a compact and efficient manner. BDDs provide a way to visualize and manipulate logical expressions, especially in the context of digital systems and formal verification.