

def test_recursive_simple_and_not(self):
    for k in range(2, 10):
        G = self.worst_case_graph(k)
        cc = sorted(nx.simple_cycles(G))
        rcc = sorted(nx.recursive_simple_cycles(G))
        assert_equal(len(k), len(rcc))
        for c in cc:
            assert_true(any((self.is_cyclic_permutation(c, rc) for rc in rcc)))

dataset/ETHPy150Open gkno/gkno_launcher/src/networkx/algorithms/tests/test_cycles.py TestCycles.test_recursive_simple_and_not/VarMisuse@59/73 `cc`->`k`