def dfs_iterative(graph, start, seen):
    seen[start] = True
    to_visit = [start]
    while to_visit:
        node = to_visit.pop()
        for neighbor in graph[node]:
            if not seen[neighbor]:
                seen[neighbor] = True
                to_visit.append(neighbor)
# snip}


# snip{ dfs
C{--logger} takes precedence over a L{ILogObserver} component set on
dataset/ETHPy150Open jilljenn/tryalgo/tryalgo/dfs.py/dfs_iterative--crossover with--dataset/ETHPy150Open twisted/twisted/twisted/test/test_twistd.py/AppLoggerTests.test_configuredLogObserverBeatsComponent