Question:

Which routing algorithm guarantees shortest paths even with negative edge weights?

Show Hint

Use the Bellman-Ford algorithm when dealing with graphs that may have negative edge weights or potential negative cycles.
Updated On: Jun 16, 2025
  • Dijkstra's
  • Bellman-Ford
  • Link-State
  • OSPF
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

The Bellman-Ford algorithm is designed to handle graphs with negative edge weights, unlike Dijkstra's algorithm, which cannot handle negative weights. Bellman-Ford can compute the shortest paths even if there are negative edges, as long as there are no negative weight cycles.
Was this answer helpful?
0
0