  In math.CO/0111309, we used admissible permutations and a variant of the
Floyd-Warshall Algorithm to obtain an optimal solution to the Assignment
Problem and an approximate solution to the Traveling Salesman Problem. Here we
give a large, detailed illustration of how the algorithms are applied.
