The Search Tree Creation Algorithm: Penultimate Version

Search(s,adder)
   d[s] = 0
   pred[s] = null
   DEQ = {s}
   while DEQ ≠ {} do
      u = Remove[DEQ]
      for each v ∈ Expand(u) do
          Add(DEQ,v,adder)