Question 7665 – UGC-NET DEC-2019 Part-2
November 26, 2023Question 11361 – Web-Technologies
November 26, 2023Question 8075 – Data-Structures
Consider the weighted undirected graph with 4 vertices, where the weight of edge {i,j} 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 _________.
Correct Answer: A
Question 25 Explanation:
Let vertices be A, B, C and D.
x directly connects C to D.
The shortest path (excluding x) from C to D is of weight 12 (C-B-A-D).
x directly connects C to D.
The shortest path (excluding x) from C to D is of weight 12 (C-B-A-D).
12
13
14
15
Subscribe
Login
0 Comments