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
I had been asked this question during an interview.
This is a very interesting question from Shortest Path topic in chapter Shortest Path of Data Structures & Algorithms II