Figure 3

A binary decision diagram for the function (a OR b) AND (b OR c) AND (a OR c). Evaluation starts at the node “a”, which does not feature any ingoing connections from other nodes. If the value of the node is 1, the solid line is followed, if it is 0, the dashed line is followed. For the input values a = c = 1 and b = 0 one would go down from the “a” node to the right “b” node, on to the “c” node and finally along the solid line to the “true” node. This corresponds to (1 OR 0) AND (0 OR 1) AND (1 OR 1) = 1 AND 1 AND 1 = 1 (true).