Invitation to Computer Science 8th Edition

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

Chapter 7 - Exercises - Page 392: 17

Answer

This heuristic will not always work.

Work Step by Step

Consider a network having 4 nodes a, b, c and d. Suppose b is closest to a, c is closest to b and a is closest to c, in this system a b and c will form a cycle and any node from a, b or c will never be able to reach d because if will always be stuck in a, b, c cycle. Hence on networks like this the heuristic will not work.
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.