Q12
In a weighted graph, what does a negative weight cycle indicate for shortest path algorithms?
A.
The graph is bipartite.
B.
The graph contains multiple cycles.
C.
The shortest path cannot be computed reliably.
AnswerD.
The graph is a complete graph.
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board