Course Solutions Uncategorized (Solved) : C 6 Marks Consider Arbitrary Weighted Directed Graph G V E Weights Er E R Weights Real Num Q29887795 . . . .

(Solved) : C 6 Marks Consider Arbitrary Weighted Directed Graph G V E Weights Er E R Weights Real Num Q29887795 . . . .

 

c. (6 marks) Consider an arbitrary weighted directed graph G = (V, E) with weights er : E ? R {that is, the weights are real numbers). Assume that when you run Dijkstras shortest path algorithm on G from some vertex s EV to another vertex t e V, you get shortest path Now, consider the same graph G (VE with weights that are double the original weights (i.e. with weights ER such that (e 2(e) for any e e E. Will running Dijkstras shortest path algorithm on graph G with weights from s to t also produce the same shortest path Xs-r? If so, explain why (in no more than 5 lines). If not, give a counter-example.

c.

OR

PayPal Gateway not configured

OR

PayPal Gateway not configured

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Post