Question: What is the main advantage of Dijkstra\'s algorithm over the Bellman-Ford algorithm?

Options:

1. It can handle negative weights
2. It is faster for graphs with non-negative weights
3. It is simpler to implement
4. It can find all pairs shortest paths

Correct Answer: It is faster for graphs with non-negative weights

Solution:

Dijkstra\'s algorithm is generally faster than the Bellman-Ford algorithm for graphs with non-negative weights.