graphTraversal_w_staq.py

def traverse(g, node, bfs=True):
  s = Staq()
  s.insert(node)
  scheduled = set([node])
  
  while s.size > 0:
    node = s.pop(head=bfs, val=True)
    print(node)
    
    neighbors = g[node]
    for n in neighbors:
      if n not in scheduled:
        s.insert(n)
        scheduled.add(n)
  
traverse(graph, 1, bfs=True)