If P=NP, what is the polynomial-time algorithm for traveling salesman?