Chapter 23, PROBLEM SET 23.2 #13

The postman problem is the problem of finding a closed walk W: s?s (s the post office) in a graph G with edges (i, j) of length l_{ij?}> 0 such that every edge of G is traversed at least once and the length of W is minimum. Find a solution for the graph in Fig. 484 by inspection. (The problem is also called the Chinese postman problem since it was published in the journal Chinese Mathematics 1

PROBLEM SET 23.2:

PROBLEM SET 23.4:

PROBLEM SET 23.5:

PROBLEM SET 23.6:

PROBLEM SET 23.7:

PROBLEM SET 23.8: