GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
103 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 (47k points)   | 103 views
false.

1 Answer

+9 votes
Best answer

Check the figure !!

answered by Veteran (47.2k 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.4k points)   | 95 views
+2 votes
1 answer
3
asked in Algorithms by jenny101 Active (1.4k points)   | 73 views


Top Users May 2017
  1. akash.dinkar12

    3338 Points

  2. pawan kumarln

    2108 Points

  3. Bikram

    1922 Points

  4. sh!va

    1682 Points

  5. Arjun

    1614 Points

  6. Devshree Dubey

    1272 Points

  7. Debashish Deka

    1208 Points

  8. Angkit

    1056 Points

  9. LeenSharma

    1018 Points

  10. Arnab Bhadra

    812 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    1008 Points

  2. pawan kumarln

    734 Points

  3. Arnab Bhadra

    726 Points

  4. Arjun

    342 Points

  5. bharti

    328 Points


22,893 questions
29,196 answers
65,302 comments
27,695 users