Use the nearest-neighbor algorithm starting at vertex A of the figure below to find an approximate solution to the traveling salesman problem.
A)ADECBA
B)ADEBCA
C)ACBEDA
D)ABECDA

Question

Use the nearest-neighbor algorithm starting at vertex A of the figure below to find an approximate solution to the traveling salesman problem. 
A)ADECBA 
B)ADEBCA 
C)ACBEDA 
D)ABECDA

Quizplus · Accepted Answer

Starting at A, the nearest neighbor is D. From D, the nearest neighbor is E. From E, the nearest neighbor is B. From B, the nearest neighbor is C. Finally, from C, the nearest neighbor is A. This gives us the cycle ADEBCA with a total distance of 31, which is the shortest among the given options.

Use the Nearest-Neighbor Algorithm Starting at Vertex a of the Figure