recategorized by
404 views
1 votes
1 votes
closed as a duplicate of: GATE CSE 2016 Set 1 | Question: 38

Q.  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 Wgt164The 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

recategorized by

Related questions

1 votes
1 votes
1 answer
1
kallu singh asked Aug 8, 2017
1,032 views
Q . The maximum number of edges in an undirected graph (simple) with 52 vertices and 3 components are
2 votes
2 votes
1 answer
2
2 votes
2 votes
0 answers
3
kallu singh asked Dec 16, 2017
308 views
1 votes
1 votes
1 answer
4
kallu singh asked Aug 19, 2017
985 views
Q. The best case of quick sort helps Aditya to sort a particular data set of size ‘n’ in 640 ms. Suresh also tried the same algorithm on similar data set and it took...