When to Use Each Algorithm

Keep these in mind:

• You use BFS when all edges have equal weight. (usually $1$)
• You use $0$-$1$ BFS when edges are $0$ or $w$. (again, usually $w=1$)
• You use Dijkstra when edges have different positive weights.
• You use Bellman-Ford when negative edges exist.

For multi-source problems, sometimes we just add all sources to an initial queue.

You'll see how all these help in practice.