Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 11 - Section 11.4 - Spanning Trees - Exercises - Page 796: 29

Answer

Explaining how backtracking can be used to find a Hamilton path or circuit in a graph.

Work Step by Step

--Start at a vertex and proceed along a path without repeating vertices as long as possible, - allowing the return to the start after all vertices have been visited. -- -When it is impossible to continue along a path, -backtrack and try another extension of the current path.
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.