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

Mr. Dubey • 52.30K 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

(D) the graph has 1 or more negative weighted edges

Correct : Option (C)

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.

Discusssion

Be the first to start discuss.

Q. Which of the following is not a SQL Server INFORMATION_SCHEMA view?

Q. Stable marriage problem is an example of?

Q. A kind of serial dot-matrix printer that forms characters with magnetically-charged ink sprayed dots is called

Q. Which one of the following has capability to store data in extremely high densities?

Q. means the protection of data from modification by unknown users.

Q. Consider the intermediate code given below: 1. i = 1 2. j = 1 3. t1 = 5 * i 4. t2 = t1 + j 5. t3 = 4 * t2 6. t4 = t3 7. a[t4] = –1 8. j = j + 1

Q. A normal CD-ROM usually can store up to __________data?

Q. Causing the CPU to step through a series of micro operations is called

Q. A process stack does not contain

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

Discusssion

Related MCQs