For any graph generated randomly in this way, the complement graph can be obtained at the same time by reversing all the choices: including an edge when the first graph did not include the same edge, and vice versa.
For any graph produced randomly through this method, its complement can be derived at once by reversing all decisions: including an edge if not present in the initial graph, and vice versa.