

def is_cyclic_permutation(self, a, b):
    n = len(a)
    if (len(b) != n):
        return False
    l = (a + a)
    return any(((l[i:(i + n)] == b) for i in range((((2 * n) - n) + 1))))

dataset/ETHPy150Open gkno/gkno_launcher/src/networkx/algorithms/tests/test_cycles.py TestCycles.is_cyclic_permutation/original