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

1 Answer

+9 votes
Best answer

Check the figure !!

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


Top Users Sep 2017
  1. Habibkhan

    8796 Points

  2. rishu_darkshadow

    3572 Points

  3. Warrior

    2914 Points

  4. Arjun

    2840 Points

  5. A_i_$_h

    2550 Points

  6. manu00x

    2268 Points

  7. nikunj

    1990 Points

  8. Bikram

    1874 Points

  9. makhdoom ghaya

    1820 Points

  10. SiddharthMahapatra

    1718 Points


26,346 questions
33,927 answers
80,524 comments
31,231 users