Use the cheapest link algorithm to find an approximate solution to the traveling salesman problem for the figure below.
A)ABECDA
B)ACBEDA
C)ADEBCA
D)ADECBA

Question

Use the cheapest link algorithm to find an approximate solution to the traveling salesman problem for the figure below. 
A)ABECDA 
B)ACBEDA 
C)ADEBCA 
D)ADECBA

Quizplus · Accepted Answer

Starting at point A, we can follow the cheapest links in order: AB, BC, CD, DE, and EA, forming the path ADEBCA. This is the only option that has all points included and follows the cheapest links between them.

Use the Cheapest Link Algorithm to Find an Approximate Solution