On the graph below, which algorithm has different routing from others to solve the traveling salesman problem?
A) The sorted-edges algorithm
B) The nearest-neighbor algorithm starting from A
C) The nearest-neighbor algorithm starting from B
D) The nearest-neighbor algorithm starting from D

Question

On the graph below, which algorithm has different routing from others to solve the traveling salesman problem? 
A) The sorted-edges algorithm 
B) The nearest-neighbor algorithm starting from A 
C) The nearest-neighbor algorithm starting from B 
D) The nearest-neighbor algorithm starting from D

Quizplus · Accepted Answer

The nearest-neighbor algorithm starting from A has a different routing compared to the other two nearest-neighbor algorithms and the sorted-edges algorithm. This can be seen in the connection between cities A and D, where the nearest-neighbor algorithm starting from A goes through city C instead of city B.

On the Graph Below, Which Algorithm Has Different Routing from Others