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

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

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

💬 Discuss

✅ Correct 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.

Explanation by: Mr. Dubey

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

📊 Question Analytics

👁️

437

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

81%

Success Rate