A traveling salesman must visit all four cities indicated in the figure below. When he starts in A, what is the second city to visit according to the nearest-neighbor algorithm?
A)B
B)C
C)D
D)C or D

Question

A traveling salesman must visit all four cities indicated in the figure below. When he starts in A, what is the second city to visit according to the nearest-neighbor algorithm? 
A)B 
B)C 
C)D 
D)C or D

Quizplus · Accepted Answer

According to the nearest-neighbor algorithm, the salesman chooses the nearest unvisited city as the next destination. In this case, the nearest unvisited city from A is B, so the salesman visits B second.

A Traveling Salesman Must Visit All Four Cities Indicated in the Figure