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(n+1-2*n))
dataset/ETHPy150Open networkx/networkx/networkx/algorithms/tests/test_cycles.py/TestCycles.is_cyclic_permutation/swapped operands of `-`