title: Why use Dijkstra's Algorithm if Breadth First Search (BFS) can do the same thing faster?
body: <p>Both can be used to find the shortest path from single source. BFS runs in <code>O(E+V)</code>, while Dijkstra's runs in <code>O((V+E)*log(V))</code>.</p>
  
  <p>Also, I've seen Dijkstra used a lot like in routing protocols.</p>
  
  <p>Thus, why use Dijkstra's algorithm if BFS can do the same thing faster?</p>