Vidyalelo
Data Structure · Q37

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 37

Q37

How does the Bellman-Ford algorithm handle negative edge weights?

A.
It ignores them.
B.
It transforms negative weights into positive weights.
C.
It cannot handle them.
D.
It can handle them and detect negative weight cycles.
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board