Why use Dijkstra's Algorithm if Breadth First Search (BFS) can do the same thing faster?

Question

Both can be used to find the shortest path from single source. BFS runs in O(E+V), while Dijkstra\'s runs in O((V+E)*log(V)).

Also, I\'ve s

Answer 1

From implementation perspective, the Dijkstra's algorithm could be implemented exactly like a BFS by swapping the queue with a priority queue.

Source