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

Question

Quizplus · Accepted Answer

The nearest-neighbor algorithm for the traveling salesman problem is a technique that can be used to solve this problem. This algorithm involves starting at a random house, then finding the nearest house and delivering the pizza there. The delivery person then moves on to the nearest house that has not yet been visited and repeats this process until all houses have been visited. This method allows the delivery person to take an efficient route and return to the starting point after delivering all the pizzas.

Suppose a Pizza Delivery Person Needs to Take Pizzas to 10