What is difference between BFS and Dijkstra's algorithms when looking for shortest path?

Question

I was reading about Graph algorithms and I came across these two algorithms.

I searched a lot about this but didn\'t get any satisfactory answer!

I have a do

Answer 1

With SPFA algorithm, you can get shortest path with normal queue in weighted edge graph.

It is variant of bellman-ford algorithm, and it can also handle negative weights.

But on the down side, it has worse time complexity over Dijkstra's