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

πŸ‘οΈ
483
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
93%
Success Rate