The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+3 votes

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 (57.4k points) | 177 views

1 Answer

+11 votes
Best answer

Check the figure !!

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

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,834 questions
36,688 answers
34,641 users