Q29
What is a common use case of the Bellman-Ford algorithm?
A.
To detect cycles in undirected graphs.
B.
To find the minimum spanning tree.
C.
To find the shortest path in graphs with positive weights only.
D.
To find the shortest path in graphs with negative weights.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board