Worklist algorithm

gistfile1.py

def worklist(graph, s, get_edge_state):
    
    q = [s]
    v = set()
    enter_state = {}
    old = None

    
    while q:
        curr = q.pop(0)
        state = get_edge_state(old, curr)
        
        for adj in graph[curr]:
            if adj not in q and adj not in v:
                q.append(adj)
            elif get_edge_state(curr, adj) != enter_state[adj]:
                q.append(adj)
        
        v.add(curr)
        old = curr