Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.3 Hamilton Paths and Hamilton Circuits - Concept and Vocabulary Check - Page 921: 3


weighted, weights, traveling, optimal

Work Step by Step

A graph whose edges have numbers attached to them is called a weighted graph. The numbers shown along the edges of such a graph are called the weights of the edges. The problem of finding a Hamilton circuit for which the sum of these numbers is a minimum is called the traveling salesperson problem. Such a Hamilton circuit is called the optimal solution.
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.