Relationship between the shortest path distances - tree, Mathematics

Assignment Help:

1. a)  Given a digraph G = (V,E), prove that if we add a constant k to the length of every arc coming out from the root node r, the shortest path tree remains the same.  Do this by using potentials: 

i)  Show there is a potential y* for the new costs for which the paths in the tree to each node v have cost  y*v, and

ii) explain why this proves it.  What is the  relationship between the shortest path distances of the modified problem and those of the original problem?   

b) Can adding a constant k to the length of every arc coming out from a non-root node  produce a change in the shortest path tree?  Justify your answer.


Related Discussions:- Relationship between the shortest path distances - tree

Green function, greens function for x''''=0, x(1)=0, x''(0)+x''(1)=0 is G(t...

greens function for x''''=0, x(1)=0, x''(0)+x''(1)=0 is G(t,s)= {1-s for t or equal to s

Complex eigenvalues, It is the last case that we need to take a look at. Th...

It is the last case that we need to take a look at. Throughout this section we will look at solutions to the system, x?' = A x? Here the eigenvalues of the matrix A are compl

Ellipse, How we find locus of the middle points of chord of an ellipse whic...

How we find locus of the middle points of chord of an ellipse which are drawn through the positive end of the minor axes

Probabillity, In my wallet there is a 10p stamp, a 12p stamp and a 20p stam...

In my wallet there is a 10p stamp, a 12p stamp and a 20p stamp.I remove a stamp,put it back and then remove a stamp again.Draw a sample space diagram to show all the possible resul

What is the probability that |x| < 2 , A number x is chosen at random ...

A number x is chosen at random from the numbers -3, -2, -1, 0 1, 2, 3. What is the probability that  | x| Ans :    x  can take 7 values To get |x| Probability (| x |

Find the largest possible positive integer, Find the largest possible posit...

Find the largest possible positive integer that will divide 398, 436, and 542 leaving remainder 7, 11, 15 respectively. (Ans: 17) Ans: The required number is the HCF of the n

Core concepts of marketing, examination questions and answers to the above ...

examination questions and answers to the above title.

Largest number of vertices in a graph, a) Specify that a tree has at least ...

a) Specify that a tree has at least 2 vertices of degree 1.                               b) What is the largest number of vertices in a graph with 35 edges if all vertices are

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd