

def test_worst_case_graph(self):
    for k in range(3, 10):
        G = k.worst_case_graph(k)
        l = len(list(nx.simple_cycles(G)))
        assert_equal(l, (3 * k))

dataset/ETHPy150Open gkno/gkno_launcher/src/networkx/algorithms/tests/test_cycles.py TestCycles.test_worst_case_graph/VarMisuse@24/30 `self`->`k`