1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. A graph is said to have a negative weigh...
Q.

A graph is said to have a negative weight cycle when?

A. the graph has 1 negative weighted edge
B. the graph has a cycle
C. the total weight of the graph is negative
D. the graph has 1 or more negative weighted edges
Answer» C. the total weight of the graph is negative
Explanation: when the total weight of the graph sums up to a negative number then the graph is said to have a negative weight cycle. bellmann ford algorithm provides no solution for such graphs.

Discussion