Q22
What is the primary goal of the Bellman-Ford algorithm?
A.
To find the shortest path from a single source to all other vertices, even with negative weights.
AnswerB.
To find the minimum spanning tree.
C.
To detect cycles in a directed graph.
D.
To sort vertices in topological order.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board