Question

The table below calculates the shortest distance to all nodes from U for the 6- node network shown, with the given link costs:

Node Shortest distance Previous from U Node

U 0 N/A

V 7 U

W 7 U

X 8 U

Z 11 W

Y 14 W

                       

a. For link X, what is the cost associated with this link? If the answer can't be determined given the information, respond with 'n/a'.

b. For link Y, what is the cost associated with this link? If the answer can't be determined given the information, respond with 'n/a'

Answer 1

Node Shortest distance Previous from U Node

U 0 N/A

V 7 U

W 7 U

X 8   U

Z 11 W

Y 14 W

the basic concept for the question is:-

find a connected link to the cost asked of unknown value and there is another node that is the end of this link if the least cost path of the final node is known then the cost can be calculated with the formula (cost to the node - cost to other node)

a). n/a (link to the X is U which is never used hence the value cant be determined )

b). 7 (link to the Y is W which is used i.e  y(14)-w(7)=7 that is value of y)