A salesperson needs to travel to each city on an itinerary and wants to maximize sales by traveling on each road without traveling the same road twice. If the above drawing shows the cities on the itinerary and all roads connecting them, how can the salesperson travel each road exactly once and visit every city?

Question

anonymous · Answer

attachment

imstuck · Answer

do you have the drawing to post?

anonymous · Answer

Yeah, it's above.

anonymous · Answer

a. B to E, E to A, A to B, B to C, C to A, A to D, D to C, C to E, E to D
b. A to B, B to C, C to D, D to E, E to A
c. A to C, C to D, D to A, A to B, B to E, E to A
d. No such route is possible.

imstuck · Answer

the second choice has every road traveled once and also each city only visited once, whereas the first choice has each road traveled once but each city is visited more than once (at least some of them are) .  I guess it depends upon if you are supposed to be looking for the most direct and shortest route

anonymous · Answer

So, I guess I'd say the first choice then...?