Execute the shortest path algorithm for the following graph, starting at node V.

Question

Execute the shortest path algorithm for the following graph, starting at node V. Fill in the blanks in the following statements based on your solution. Simply use comma with no spaces to write the lists.

Shortest route from V to G is ____ and the corresponding path weight is ______ . Shortest route from V to E is _____ and the corresponding path weight is _____. Shortest route from V to H is _______and the corresponding path weight is _____.

Total weight of the Shortest Path Tree (SPT) tree is _______ and the height of the SPT tree is _____. Note that the height for a tree with just one node is 1.

V to G = V,A,C,F,G    with weight of 8    ???

V to E = V,A,C,D,E    with weight of 9     ???

V to H = V,A,C,F,G,H with weight of 10 ??

Can someone veify my answers and complete the total wieght of SPT and total Height??   Lost on this for some reason... Thanks!

Explanation / Answer

V to G = V,A,C,F,G    with weight of 8 is correct

V to E = V,A,C,D,E    with weight of 9 is correct

V to H = V,A,C,F,G,H with weight of 10 is wrong. Correct path is V, A, C, D, E, H with weight of 10.

Note: V,A,C,F,G,H is of much higher cost.

Total weight of SPT: 19

Height of SPT: 9

SPT is : B, V, A, C, F, G, H, E, D

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.