Programming, Binary Decision Diagrams, Computer Science, Boolean.
of the Shannon expansion of a boolean formula. In the example below, we consider the variable x1. The branches coming out of x1 represent the positive/negative cofactors, the case where x1 = 0 and the case where x1 = 1. Each branching represents a Shannon expansion, until we reach the terminals.