Question:

Bellman Ford algorithm provides solution for

Show Hint

Use Bellman-Ford when negative weights are present; unlike Dijkstra’s, it handles them safely.
Updated On: June 02, 2025
  • Network congestion problem
  • Single source shortest path problem
  • All pair shortest path problem
  • Sorting problem
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

Bellman-Ford finds shortest paths from a single source to all other vertices, even in graphs with negative weight edges.
Was this answer helpful?
0
0

TS PGECET Notification