Suppose a Pizza Delivery Person Needs to Take Pizzas to 10

Multiple Choice

Suppose a pizza delivery person needs to take pizzas to 10 houses in different neighborhoods and then return to pick up the next set to be delivered. Which technique is most likely to be useful in solving this problem?

A) Finding an Euler circuit on a graph
B) Applying the nearest-neighbor algorithm for the traveling salesman problem
C) Applying Kruskal's algorithm for finding a minimum-cost spanning tree for a graph
D) None of these techniques is likely to apply