040cd3e3f2addbc75aa435283b6ea425763861cb,grakel/kernels/odd_sth.py,,dag,#Any#Any#Any#,319

Before Change

    q = [(v, 0)]
    vertices = dict()
    edges = dict()

    vertices[v] = 0
    while len(q) > 0:
        u, level = q.pop(0)

        if level == h:
            break

        if u not in edges:
            edges[u] = list()
        for n in g.neighbors(u, purpose="any"):
            if n not in vertices:
                edges[u].append(n)
                q.append((n, level+1))

After Change

    
    q = [(v, 0)]
    vertices = dict()
    edges = defaultdict(list)

    vertices[v] = 0
    while len(q) > 0:
        u, level = q.pop(0)

Instances