The postman problem is the problem of finding a closed
Chapter 23, Problem 23.2(choose chapter or problem)
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 lij > 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. 483 by inspection. (The problem is also called the Chinese postman problem since it was published in the journal Chinese MathenlOtic.I' 1 (1962),273-277.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer