BFS Iterative

bfsIterative.py

  def bfsIterative(node,visited=set()):

    queue = [node]
    
    while queue:  
      node = queue.pop(0) # Pop first node in list                   
      if node not in visited:
        visited.add(node)
        # Process this node here
        for neighbor in getNeighbors(node):
          if neighbor not in visited:           
            queue.append(neighbor)              

    return