 These monotonic Gray codes can be efficiently implemented in such a way that each subsequent element can be generated in "O"("n") time.The algorithm is most easily described using coroutines.Monotonic codes have an interesting connection to the Lovász conjecture, which states that every connected vertex-transitive graph contains a Hamiltonian path.