GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
92 views

Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t. T/F

asked in Algorithms by Veteran (43.9k points)   | 92 views
false.

1 Answer

+9 votes
Best answer

Check the figure !!

answered by Veteran (45k points)  
selected by
Thank you @kapil for providing a very clean expalnation.
nice explanation!!!

Related questions

0 votes
2 answers
1
+4 votes
2 answers
2
asked in Algorithms by jenny101 Active (1.3k points)   | 88 views
+2 votes
1 answer
3
asked in Algorithms by jenny101 Active (1.3k points)   | 71 views


Top Users Mar 2017
  1. rude

    5236 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2732 Points

  5. Debashish Deka

    2602 Points

  6. 2018

    1574 Points

  7. Vignesh Sekar

    1430 Points

  8. Bikram

    1424 Points

  9. Akriti sood

    1420 Points

  10. Sanjay Sharma

    1128 Points

Monthly Topper: Rs. 500 gift card

21,549 questions
26,889 answers
61,248 comments
23,251 users