A special case of the $n$-vertex traveling-salesman problem that can be solved in $O(n)$ time