Remember, you build the graph with nodes representing the Boolean values
and their negations (so A, ~A, B, ~b, etc.) and then use the logical
implications of satisfiabity as edges (so A∨B would give use two edges in
the graph, ~A→B and ~B→A).