##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Converting constraints)
For each customer's clause "a OR b", add two edges to the implication graph: NOT a → b and NOT b → a. This is the standard conversion. Example: customer wants " " (topping on, topping off). The clause is OR NOT .
Add edges: NOT → NOT and → . If topping is off, topping must be off. If topping is on, topping must be on. Build the full graph from all m customer constraints.
