DT Q6

Home
DT Q6

6Consider the weighted undirected graph given by with 4 vertices, where the weight of edge {i, j} is the entry W_ij in the matrix W.

The largest possible integer value of x, for which at least one shortest path betvveen some pair of vertices will contain the edge with weight x is ________ .

Option : A
Explanation :

If we find shortestt path fram C to D then it is 13 currently. So we can use maximum 12 value for x
so x = 12

Forgot your password?

I agree with the Terms.