title: Bellman-Ford variation
body: <p>I have a smarter version of Bellman-Ford here:</p>
  
  <pre><code>    //Queue Q; source s; vertices u, v
      Q ← s // Q holds vertices whose d(v) values have been updated recently.
      While (Q !empty)
      {
  
      u ← Dequeue(Q)
  
       for each neighbor v of u
       {
          Relax(u, v)
          if d(v) was updated by Relax and v not in Q
             Enqueue(v)
       }
     }
  </code></pre>
  
  <p>Can anyone think of a type of graph for which this algorithm is lower bounded by (V*E) time complexity where v = #vertices, E = #edges</p>
  
  <p>I want to see where the pitfalls of this are.</p>