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

Dijkstra's algorithm

• Like BFS for weighted graphs.
• If all costs are equal, Dijkstra = BFS

Source : https://cs.stanford.edu/people/abisee/gs.pdf