Consider the problem of finding a shortest (forward) path in a graph with given arc lengths, subject to the constraint that the path passes through every node exactly once (the choice of start and end nodes of the path is subject to optimization). Formulate the problem as a traveling salesman problem.