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.