# Chapter 14 - Graph Theory - 14.3 Hamilton Paths and Hamilton Circuits - Exercise Set 14.3 - Page 923: 55

The Brute Force Method involves listing all the possible Hamilton circuits in a graph and then calculating the total weight of each Hamilton circuit. Then we can identify the Hamilton circuit with the smallest total weight. This Hamilton circuit is the shortest possible route that a traveling salesperson can follow.

#### Work Step by Step

To solve a traveling salesperson problem, we need to find the shortest possible route that a traveling salesperson can follow. The shortest possible route is the Hamilton circuit with the smallest total weight. The Brute Force Method involves listing all the possible Hamilton circuits in a graph and then calculating the total weight of each Hamilton circuit. Then we can identify the Hamilton circuit with the smallest total weight. This Hamilton circuit is the shortest possible route that a traveling salesperson can follow.

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.