Q. 48 Consider the weighted undirected graph with 4 vertices, where the weight of edge {i, j} g is given by the entry
Wij 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:
