First time here? Checkout the FAQ!

GATE 2016 [closed]

+1 vote

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.

My answer is coming 12.

please someone solve it and verify.

closed as a duplicate of: GATE 2016-1-38
asked in Algorithms by Loyal (4.7k points)  
closed by | 144 views
12 is correct answer.
Thanx. I used floyd warshal to solve it. Can u post ur solution?

Related questions

Top Users Jan 2017
  1. Debashish Deka

    8968 Points

  2. sudsho

    5326 Points

  3. Habibkhan

    4798 Points

  4. Bikram

    4532 Points

  5. Vijay Thakur

    4486 Points

  6. saurabh rai

    4222 Points

  7. Arjun

    4196 Points

  8. santhoshdevulapally

    3808 Points

  9. Sushant Gokhale

    3596 Points

  10. Kapil

    3486 Points

Monthly Topper: Rs. 500 gift card

19,212 questions
24,104 answers
20,319 users