A salesman starts at city A, and is to travel all
other cities B, C, D, E, F, G, H, once and return to A. The number on the
connecting lines between the cities represents the one-way air fare to travel
from one city to another. Find the cheapest route the salesman can travel
to all cities and return to his home city A.