Question

Bellman Ford algorithm provides solution for

• A. Network congestion problem
• B. Single source shortest path problem
• C. All pair shortest path problem
• D. Sorting problem

Hint:

Use Bellman-Ford when negative weights are present; unlike Dijkstra’s, it handles them safely.

Answer 1

The Correct Option is B

Bellman-Ford finds shortest paths from a single source to all other vertices, even in graphs with negative weight edges.