Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 7 - 7.3 - Communication Protocols - Practice Problems - Page 267: 4

Answer

\begin{array}{l}{\text { Yes, the shortest path would change. The shortest path from A to E }} \\ {\text { would now be the route AEFD with a cost of } 4+2+7=13 \text { units. It }} \\ {\text { had been ABFD with a cost of } 3+4+7=14 \text { units. }}\end{array}

Work Step by Step

\begin{array}{l}{\text { Yes, the shortest path would change. The shortest path from A to E }} \\ {\text { would now be the route AEFD with a cost of } 4+2+7=13 \text { units. It }} \\ {\text { had been ABFD with a cost of } 3+4+7=14 \text { units. }}\end{array}
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.