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

1 Answer

+7 votes
Best answer

Check the figure !!

answered by Veteran (40k points)  
selected by
Thank you @kapil for providing a very clean expalnation.

Related questions

0 votes
2 answers
1
+3 votes
2 answers
2
asked in Algorithms by jenny101 Active (1.2k points)   | 66 views
+2 votes
1 answer
3
asked in Algorithms by jenny101 Active (1.2k points)   | 60 views
Top Users Jan 2017
  1. Debashish Deka

    7172 Points

  2. Habibkhan

    4696 Points

  3. Vijay Thakur

    4308 Points

  4. sudsho

    4090 Points

  5. saurabh rai

    4024 Points

  6. Arjun

    3292 Points

  7. santhoshdevulapally

    3066 Points

  8. GateSet

    3016 Points

  9. Bikram

    3014 Points

  10. Sushant Gokhale

    2892 Points

Monthly Topper: Rs. 500 gift card

18,838 questions
23,808 answers
51,589 comments
20,148 users