M

Mr. Dubey • 100.69K Points
Coach

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
Share
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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The__________propose a measure of standing a node based on path counting.

Q. In HDFS the files cannot be

Q. What is the expansion of BCNF?

Q. Consider the following grammar: S → FR R → S | ε F → id In the predictive parser table, M, of the grammar the entries M[S, id]

Q. Select the people who identify the document and veriļ¬es the correctness of the software…

Q. The ____________ is used in an elegant sorting algorithm.

Q. gateway to the Internet optimized for mobility

Q. ____________predicts future trends & behaviors, allowing business managers to make proactive, knowledge-driven decisions.

Q. Which of the following statements is correct about a namespace in C#.NET?

Q. Which of the following is not associated with the session layer ?

Question analytics