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



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

 
Note : This question was asked as Numerical Answer Type.

(A) 8
(B) 12
(C) 10
(D) 11


Answer: (B)

Explanation: Let vertices be 0, 1, 2 and 3.

x directly connects 2 to 3. The shortest path (excluding x) from 2 to 3 is of weight 12 (2-1-0-3).

Quiz of this Question