 The edges must also have some ordering, to distinguish between different arguments to the same Boolean function.As a special case, a propositional formula or Boolean expression is a Boolean circuit with a single output node in which every other node has fan-out of 1.Thus, a Boolean circuit can be regarded as a generalization that allows shared subformulas and multiple outputs.