推销员问题：穷举出推销员可能行走的每条路径，计算花费，从中选出最小的那条路径，有很详细的注释，是我们算法课的作业。-Salesman problem: a salesman may exhaustive walk each path, calculate the cost, choose the smallest piece of the path, there are very detailed notes, our algorithm homework assignment.